Aarts, E.H.L., Van Laarhoven, P.J.M., Lenstra, J.K., & Ulder, N.L.J. (1994). A computational study of local search algorithms for job shop scheduling. ORSA Journal on Computing 6, 118–125.
Abumaizar, R.J., & Svestka, J.A. (1997). Rescheduling job shops under random disruptions. International Journal of Production Research 35(7), 2065–2082.
Adams, J., Balas, E., & Zawack, D. (1988). The shifting bottleneck procedure for job shop scheduling. Management Science 34(3), 391–401.
Binato, S., Hery, W., Loewenstern, D., & Resende, M. (2000). A GRASP for Job Shop Scheduling. Dordrecht: Kluwer Academic.
Blackstone, J.H. Jr, Phillips, D.T., & Hogg, G.L. (1982). A state-of-the-art survey of dispatching rules for manufacturing job shop operations. International Journal of Production Research 20(1), 27–45.
Demir, Y., & Isleyen, S.K. (2014). An effective genetic algorithm for flexible job-shop scheduling with overlapping in operations. International Journal of Production Research 52(13), 3905–3921.
Fahmy, S.A., Balakrishnan, A., & ElMekkawy, T.Y. (2008). A generic deadlock-free reactive scheduling approach. International Journal of Production Research 46(1), 1–20.
Ghasem, M., & Mehdi, M. (2011). A Pareto approach to multi-objective flexible job-shop scheduling problem using particle swarm optimization and local search. International Journal of Production Economics 129(1), 14–22.
Hasan, S.M.K., Sarker, R., & Essam, D. (2011). Genetic algorithm for job-shop scheduling with machine unavailability and breakdown. International Journal of Production Research 49(16), 4999–5015.
Hasan, S.M.K., Sarker, R., Essam, D., & Cornforth, D. (2009). Memetic algorithms for solving job-shop scheduling problems. Memetic Computing 1(1), 69–83.
Lawrence, S. (1985). Job Shop Scheduling with Genetic Algorithms: First International Conference on Genetic Algorithms, pp. 136–140. Mahwah, NJ: Erlbaum.
Lei, D. (2011). Simplified multi-objective genetic algorithms for stochastic job shop scheduling. Applied Soft Computing 11(8), 4991–4996.
Liu, S.Q., Ong, H.L., & Ng, K.M. (2005). Metaheuristics for minimizing the makespan of the dynamic shop scheduling problem. Advances in Engineering Software 36(3), 199–205.
Meeran, S., & Morshed, M.S. (2012). A hybrid genetic tabu search algorithm for solving job shop scheduling problems: a case study. Journal of Intelligent Manufacturing 23(4), 1063–1078.
Nakano, R., & Yamada, T. (1991). Conventional genetic algorithm for job shop problems. Proc. Fourth Int. Conf. Genetic Algorithms, pp. 474–479. San Mateo, CA: Kaufmann.
Nasr, A.-H., & ElMekkawy, T.Y. (2011). Robust and stable flexible job shop scheduling with random machine breakdowns using a hybrid genetic algorithm. International Journal of Production Economics 132(2), 279–291.
Paredis, J. (1992). Exploiting constraints as background knowledge for genetic algorithms: a case-study for scheduling. In Parallel Problem Solving from Nature, Vol. 2, pp. 229–238. Amsterdam: North-Holland.
Pezzella, F., Morganti, G., & Ciaschetti, G. (2008). A genetic algorithm for the flexible job-shop scheduling problem. Computers & Operations Research 35(10), 3202–3212.
Ponnambalam, S.G., Aravindan, P., & Rao, P.S. (2001). Comparative evaluation of genetic algorithms for job-shop scheduling. Production Planning & Control 12(6), 560–674.
Qing-dao-er-ji, R., & Wang, Y. (2012). A new hybrid genetic algorithm for job shop scheduling problem. Computers & Operations Research 39(10), 2291–2299.
Qiu, X., & Lau, H.Y.K. (2014). An AIS-based algorithm for static job shop scheduling problem. Journal of Intelligent Manufacturing 25, 489–503.
Subramaniam, V., Raheja, A.S., & Reddy, K.R.B. (2005). Reactive repair tool for job shop schedules. International Journal of Production Research 43(1), 1–23.
Wu, S.D., Storer, R.H., & Pei-Chann, C. (1993). One-machine rescheduling heuristics with efficiency and stability as criteria. Computers & Operations Research 20(1), 1–14.
Yamada, T. (2003). Studies on metaheuristics for jobshop and flowshop scheduling problems. PhD Thesis, Kyoto University, Department of Applied Mathematics and Physics, pp. 1–120.
Yamada, T., & Nakano, R. (1997). Genetic algorithms for job-shop scheduling problems. In Modern Heuristic for Decision Support, pp. 67–81. UNICOM seminar, London.
Zhang, L., Gao, L., & Li, X. (2013). A hybrid genetic algorithm and tabu search for a multi-objective dynamic job shop scheduling problem. International Journal of Production Research 51(12), 3516–3531.