A survey of genetic algorithms for shop scheduling problems

Heuristics: Theory and Applications

Volumn , Issue , 2013, Pages 161-222

  Werner, Frank ^a  

^a OTTO VON GUERICKE UNIVERSITY   (Germany)

Author keywords

Flow shop; Genetic algorithms; Job shop; Open shop; Scheduling

Indexed keywords

EID: 84895406687     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Chapter

References (138)

1. Ablay, P. Optimieren mit Evolutionsstrategien. Reihenfolgeprobleme, nichtlineare und ganzzahlige Optimierung. Ph.D. Thesis, University of Heidelberg, 1979.
2. Abdelmaguid, R. Representations in genetic algorithm for the job shop scheduling problem: A computational study. J Software Engineering & Applications, 2010, 3, 1155-1162.
3. Aldowaisan, T.; Allahverdi, A. New heuristics for no-wait flowshops to minimize makespan. Comp Oper Res, 2003, 30, 335-344.
4. Allahverdi, A.; Ng, C.T.; Cheng, T.C.E.; Kovalyov, M. A survey of scheduling problems with setup times or costs. Eur J Oper Res, 2008, 187, 985-1032.
5. Andresen, M.; Bràsel, H.; Engelhardt, E; Werner, F. LiSA -A library of scheduling algorithms, Handbook for Version 3. 0. TR 10-02, FMA, OvGUMagdeburg, 2010, 107 pp.
6. Andresen, M.; Bràsel, H.; Mòrig, M.; Tautenhahn, T.; Tusch, J.; Werner, F. Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop. Math Comp Modell, 2008, 48, 1278-1293.
7. Andresen, M.; Bràsel, H.; Plauschin, M.; Werner, F. Using Simulated annealing for open shop scheduling with sum criteria. In: Cher Ming Tan (ed.), Simulated Annealing, In-Teh, 2008, 49-76.
8. Applegate, D.; Cook, W. A computational study of the job-shop scheduling problem. ORSA Journal on Computing, 1991, 3, 149-156.
9. Basseur, M.; Seynhaeve, E; Talbi, E. Design of multi-objective evolutionary algorithms: Application to the flow-shop scheduling problem. In: Congress on Evolutionary Computation (CEC' 2002), 2002, 2, 1151-1156.
10. Beasley, D.; Bull, D.R.; Martin, R.R. An overview on genetic algorithms: Part I, Fundamentals. University Computing, 1993, 15, 58-69.
11. Bierwirth, C. A generalized permutation approach to job shop scheduling with genetic algorithms. OR Spectrum, 1995, 17, 87-92.
12. Bierwirth, C; Mattfeld, D.C.; Kopfer, H. On permutation representations for scheduling problems, in: 4th PPSN, 1996, 310-318.
13. Bràsel, H.; Herms, A.; Mòrig, M.; Tautenhahn, T.; Tusch, J.; Werner, F. Heuristic constructive algorithms for open shop scheduling to minimize mean flow time. Eur J OperRes, 2008, 189, 856-870.
14. Brucker, P.; Hurink, J.; Jurisch, B,; Wòstmann, B. A branch & bound algorithm for the open-shop problem. Discr Appi Math, 1997, 76, 43-59.
15. Brucker, P.; Hurink, J.; Werner, F. Improving local search heuristics for some scheduling problems -1. Discr Appi Math, 1996, 65, 97-122.
16. Brucker, P.; Hurink, J.; Werner, F. Improving local search heuristics for some scheduling problems. Part II. Discr Appi Math, 1997, 72, 47-69.
17. Brucker, P.; Thiele, O. A branch and bound method for the general-job shop problem with sequence-dependent setup times. OR Spektrum, 1996, 18, 145-161.
18. Campbell, H.G.; Dudek, R.A.; Smith, M.L. A heuristic algorithm for the n job, m machine sequencing problem. Management Sci, 1970, 16, 630-637.
19. Carlier, J.; Neron, E. An exact method for solving the multiprocessor flowshop. RAIRO Operations Research, 2000, 34, 1-25.
20. Chang, P.C.; Chen, S.H.; Liu, C.H. Sub-population genetic algorithm with mining gene structures for multiobjective flowshop scheduling problems. Expert Systems with
21. Chang, P.-C; Liu, C.-H.; Fan, C.-Y. A depth-first mutation-based genetic algorithm for flow shop scheduling problems, International Conference on Hybrid Information Technology, 2006, 1, 25-32.
22. Chen, J.-S.; Pan, J.C.-FL; Lin, C.-M. A hybrid genetic algorithm for the re-entrant flow-shop scheduling problem. In: Levner, E. (ed), Multiprocessor scheduling: Theory and Applications INTECH, 2007, 154-166.
23. Chen, C.-L.; Vempati, V.S.; Aljaber N. An application of genetic algorithms for flow shop problems. Eur J Oper Res, 1995, 80, 389-396.
24. Cheung, W.; Zhou, H. Using genetic algorithms and heuristics for job shop scheduling with sequence-dependent setup times. Ann Oper Res, 2001, 107, 65-81.
25. Choi, I.C.; Korkmaz, O. Job shop scheduling with separable sequence-dependent setup times. Ann Oper Res, 1997, 70, 155-170.
26. Dannenbring, D. An evaluation of flow shop sequencing heuristics. Management Sci, 1977, 23, 1174-1182.
27. Davis, L. Job Shop scheduling with genetic algorithms. In: Grefenstette (ed.), Proceedings of the First International Conference on Genetic Algorithms and Their Applications. Lawrence Erlbaum: Hillsdale, NJ, 1985, 136-140.
28. Della Croce, E; Tadei, R.; Volta, G. A genetic algorithm for the job shop scheduling problem. Comp Oper Res, 1995, 22, 15-24.
29. Demirkol, E.; Mehta, S.; Uzsoy, R. Benchmarks for shop scheduling problems. Eur J Oper Res, 1998, 109, 137-141.
30. Dhingra, A.; Chandna, P. Hybrid genetic algorithm for multicriteria scheduling with sequence dependent setup time. International Journal of Engineering, 3, 2010, 510-520.
31. Dorndorf, U.; Pesch, E. Evolution based learning in a job shop scheduling environment. Comp Oper Res, 1995, 22, 25-40.
32. Etiler, O.; Toklu, B.; Atak, M.; Wilson J. A genetic algorithm for flow shop scheduling problem. J Oper Res Soc, 2004, 55, 830-835.
33. Falkenauer, E; Bouffouix, S. A genetic algorithm for the job-shop. In: Proceedings of the IEEE International Conference on Robotics and Automation, 1991, 824-829.
34. Fang, H.L.; Ross, P.; Come, D. A promising hybrid GA/heuristic approach for open shop scheduling problems. Proceedings of the 11th European Conference on Artificial Intelligence, John Wiley and Sons, 1994, 590-594.
35. Fisher, H.; Thompson, G.L. Probabilistic learning combinations of local job-shop scheduling rules. In: Muth, J.F.; Thompson, G.L. (eds.) Industrial Scheduling, Prentice Hall, Englewood Cliffs, 1963.
36. Franca, P.M.; Tin, G.; Buriol, L.S. Genetic algorithms for the no-wait flowshop sequencing problem with time restrictions. Int J Prod Res, 2006, 44, 939-957.
37. Gao, J.; Sun, L.; Gen, M. A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems. Comp Oper Res, 2008, 35, 2892-2907.
38. Ghedjati, F. Genetic algorithms for the job-shop scheduling problem with unrelated parallel constraints: heuristic mixing method machines and precedence. Comp Ind Engn, 1999, 37, 39-42.
39. Giffler, B.; Thompson, G.L. Algorithms for solving production scheduling problems. Oper Res, 1960, 8, 487-503.
40. Goldberg, D.E. Genetic algorithms in search, optimization and machine learning. Addison-Wesley, Reading, 1989.
41. Goldberg, D.E.; Lingle, R. Alleles, loci and the traveling salesman problem. In: Proceedings 1st International on Genetic Algorithms (ICGA'89), Carnegie-Mellon University Pittsburgh, 1985, 154-159.
42. Goncalves, J.F.; Magalhaes Mendes, J.J.; Resende, M.G.C. A hybrid genetic algorithm for the job shop scheduling problem. AT&T Labs Research Technical Report TD-5EAL6J, 2002.
43. Graham, R.L.; Lawler, E.L.; Lenstra, J.K.; Rinnooy Kan, A.H.G. Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 1979, 5, 287-326.
44. Gueret, C; Prins, C. A new lower bound for the open-shop problem. Ann Oper Res, 1999, 92 (1), 165-183.
45. Harmanani, H.M.; Drouby, E; Ghosn, S.B. A parallel genetic algorithm for the open-shop scheduling problem using deterministic and random moves. Proceedings of SpringSim' 09, SCS/ACM, 2009.
46. Ho, J.C.; Chang, Y.-L. A new heuristic for the n-job, m-machine flow-shop problem. EurJOperRes, 1991, 52, 194-202.
47. Holland, J.A. Adaptation in natural and artificial systems. Ann Arbor: University of Michigan, 1975.
48. Jain, A.S.; Meeran, S. Deterministic job-shop scheduling: Past, present and future. EurJOperRes, 1999, 113, 390-434.
49. Janiak, A; Portmann, M.-C. Genetic algorithm for the permutation flow-shop scheduling problem with linear models of operations. Ann Oper Res, 1998, 83, 95-114.
50. Jarboi, B.; Eddaly, M.; Siarry, P. A hybrid genetic algorithm for solving no-wait flow-shop scheduling problems. Int JAdv ManufTechnol, 2011, 54, 1129-1143.
51. Jones, G. Genetic and Evolutionary Algorithms. University of Sheffield, 2004.
52. Jolai, E; Sheikh, S.; Rabbani, M.; Karimi, B. A genetic algorithm for solvng no-wait flexible flow lines with due windows and job rejection. Int JAdv ManufTechnol, 2009, 42, 523-532.
53. Jungwattanakit, J.; Reodecha, M.; Chaovalitwongse; Werner, F. Algorithms for flexible flow shop problems with unrelated parallel machines. Int J Adv ManufTechnol, 2008, 37, 354-370.
54. Jungwattanakit, J.; Reodecha, M.; Chaovalitwongse; Werner, F. A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria. Comp Oper Res, 2009, 36, 358-378.
55. Kacem, L; Hammadi, S.; Borne, P. Approach by localization and multi-objective evolutionary optimization for flexible job-shop scheduling problems. IEEE Transactions on Systems, Man, and Cybernetics, Part C, 2002, 32 (1), 408-419.
56. Kahraman, C; Engin, O.; Kaya, L; Yilmaz, M.K. An application of effective genetic algorithms for solving hybrid flow shop scheduling problems. Intern J of Computational Intelligence Systems, 2008, 1, 134-147.
57. Khuri, S.; Miryala, S.R. Genetic algorithm for solving open shop scheduling problems. In: Proceedings 9th Portuguese Conference on Artificial Intelligence, 1999, 357-368.
58. Kobayashi, S.; Ono, I.; Yamamura, M. An efficient genetic algorithm for job shop scheduling problems. Proceedings of ICGA} 95, 1995, 506-511.
59. Kokosinski, Z.; Studzienny, L. Hybrid genetic algorithms for the open-shop scheduling problem. IJCSNS International Journal of Computer Science and Network Security, 2007, 7, 136-145.
60. Lei, D. A genetic algorithm for flexible job shop scheduling with fuzzy processing time. Int J Prod Res, 2010, 48, 2995-3013.
61. Lawrence, S. Supplement to resource constrained project scheduling: An experimental investigation of heuristic scheduling techniques. Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, 1984.
62. Li, Y.; Chen, Y. A genetic algorithm for job-shop scheduling. Journal of Software, 2010, 5, 269-274.
63. Lei, D. A genetic algorithm for flexible job shop scheduling with fuzzy processing time. Intern J Prod Res. 2009, 48 (10), 2995-3013.
64. Liaw, C.-F. A hybrid genetic algorithm for the open-shop scheduling problem. Eur J Oper Res, 2000, 124, 28-42.
65. Lin, S.-C; Goodman, E.; Punch, W.F. A Genetic Algorithm Approach to Dynamic job shop scheduling problems, Proceedings ofICGA' 97, 1997, 481-488.
66. Lin, S.-C; Goodman, E.; Punch, W.F. Investigating parallel genetic algorithms on job shop scheduling problems, Evolutionary programming VI, Lect Notes Comp Sci, 1997, 383-393.
67. Liu, T.-K.; Tsai, J.-T.; Chou, J.-H. Improved genetic algorithm for the job-shop scheduling problem. Int J Adv ManufTechnol, 2006, 27, 1021-1029.
68. Matsui, S.; Yamada, S. An empirical performance evaluation of a parameter-free genetic algorithm for job-shop scheduling problem. IEEE Congress on Evolutionary Computation (CEC 2007), 2007, 3796-3803.
69. Moon, I.; Lee, J. Genetic algorithm application to the job shop scheduling problem with alternative routings. Pusan National University, 2000.
70. Moonen, M.; Janssens, G.K. A Giffler-Thompson focused genetic algorithm for the static job-shop scheduling problem. The Journal of Information and Computational Science, 2007, 4, 609-624.
71. Murata, T; Ishibuchi, H.; Tanaka, H. Multi-objective genetic algorithm and its applications to flowshop scheduling. Computers Ind Engng, 1996, 30, 957-968.
72. Murata, T; Ishibuchi, H.; Tanaka, H. Genetic algorithms for flowshop scheduling problems. Computers Ind Engng, 1996, 30, 1061-1071.
73. Naderi, B.; Fatemi Ghomi, S.M.T.; Aminnayeri, M.; Zandieh A study on open shop scheduling to minimize total tardiness. Int J Prod Res, 2011, 49 (15), 4657-4678.
74. Nawaz, M.; Enscore, E.E.; Ham, I. A heuristic algorithm for the m-machine, n-job flow shop sequencing problem. Omega, 1983, 11, 91-95.
75. Nepalli, V.R.; Chen, C.L.; Gupta, J.N.D. Genetic algorithm for the two-stage bi-criteria flowshop problem. Eur J Oper Res, 1996, 95, 356-373.
76. Nissen, V. An overview of evolutionary algorithms in management applications. In: Biethahn, J.; Nissen, V. (eds.) Evolutionary algorithms in management applications, Springer, 1995, 44-97.
77. Nissen, V.; Biethahn, J. An introduction to evolutionary algorithms. In: Biethahn, J.; Nissen, V. (eds.) Evolutionary algorithms in management applications, Springer, 1995, 3-43.
78. Nowicki, E.; Smutnicki, C. A fast taboo search algorithm for the job-shop problem. Management Sci, 1996, 42, 797-813.
79. Oguz, C; Ercan, M.F. A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks. JSched, 2005, 8, 323-351.
80. Oliver, I.M.; Smith, D.J.; Holland, J. A study of permutation crossover operators on the traveling salesman problem. In: Proc 2nd Int Conf on Genetic Algorithms (ICGA}87), Cambridge, 1987, 224-20. EurJOperRes, 2006, 171, 674-692.
81. Onwubolu, G.C.; Mutingi, M. Genetic algorithm for minimizing tardiness in flow-shop scheduling. Prod Planning and Control, 1999, 10, 462-471.
82. Palacios, J.J.; Puente, J.; Vela C.R.; Gonzalez-Rodriguez, I. A genetic algorithm for the open shop problem with uncertain durations. Proceedings oflWINAC 2009, Part I, Lect Notes Comp Sci, 2009, 5601, 255-264.
83. Park, B.J.; Choi, H.R.; Kim, H.S. A hybrid genetic algorithm for the job shop scheduling problems. Comput Ind Engn, 2003, 45, 597-613.
84. Pasupathy, T.; Rajendran, C; Suresh, R.K. A multi-objective genetic algorithm for scheduling in flow shops to minimize the makespan and total flow time of jobs. Int J Adv ManufTechnol, 2006, 27, 804-815.
85. Peng L.H.; Salim, S. A modified Giffler and Thompson genetic algorithm on the job shop scheduling problem Mathematika, 2006, 22, 91-107.
86. Pezella, E; Morganti, G.; Ciaschetti, G. A genetic algorithm for the flexible job-shop scheduling problem. Comp Oper Res, 2008, 35, 3202-3212.
87. Ponnambalam, S.G.; Aravindan, P.; Chandrasekaran, S.: Constructive and improvement flow shop scheduling heuristics: an extensive evaluation. Prod Planning Control, 2001, 12, 45-60.
88. Ponnambalam, S.G.; Jagannathan, FL; Kataria, M.; Gadicherla, A. A TSP-GA multi-objective algorithm for flow-shop scheduling. Int J Adv ManufTechnol, 2004, 23, 909-915.
89. Potts, C.N.; Strusevich, VA. Fifty years of scheduling: A survey of milestones. /Oper Res Soc, 2009, 60, S41-S68.
90. Prins, C. Competitive genetic algorithm for the open-shop scheduling problem. Math Meth Oper Res, 2000, 52, 389-411.
91. Rajendran, C. Heuristic algorithm for scheduling in a flowshop to minimize total flow-time. Intern J Prod Econ, 1993, 29, 65-73.
92. Rajkumar, R.; Shahabudeen, P. An improved genetic algorithm for the flowshop scheduling problem. Intern J Prod Res, 2009, 47 (1), 233-249.
93. Rashidi, E.; Jahandar, M.; Zandieh, M. An improved hybrid multi-objective parallel genetic algorithm for hybrid flow shop scheduling with unrelated parallel machines. Int J Adv ManufTechnol, 2010, 49, 1129-1139.
94. Rechenberg, I. Evolutionsstrategie. Optimierung technischer Systeme nach Prinzipien der biologischen Evolution, Frommann-Holzboog, Stuttgart, 1973.
95. Reeves, C.R. A genetic algorithm for flowshop sequencing. Comp Oper Res, 1995, 22, 5-13.
96. Reeves, C; Yamada, T. Genetic algorithm, path relinking and the flowshop sequencing problem. Evolutionary computation, 1998, 12, 335-344.
97. Reza Hejazi, S.; Saghafian, S. Flowshop scheduling problems with makespan criterion: a review. Intern J Prod Res, 2005, 43, 2895-2929.
98. Ruiz, R.; Maroto A comprehensive review and evaluation of permutation flow shop heuristics. Eur J Oper Res, 2005, 165, 479-494.
99. Ruiz, R.; Maroto, C. A genetic algorithm for hybrid flowshops with sequence-dependent setup times and machine eligibility, Eur J Oper Res, 2006, 169, 781-800.
100. Ruiz, R.; Maroto, C.; Alcaraz; J. Two new robust genetic algorithms for the flowshop problem. Omega, 2006, 34, 461-476.
101. Ruiz, R.; Vazquez-Rodriguez The hybrid flow shop scheduling problem. Eur J Oper Res, 2010, 205, 1-18.
102. Sakawa, M.; Mori, T. An efficient genetic algorithm for job-shop scheduling problems with fuzzy processing time and fuzzy duedate. Comput Ind Engng, 1999, 36, 325-341.
103. Schwefel, H.R Numerische Optimierung von Computer-Modellen mittels der Evo-lutionsstrategie. Birkhàuser, Basel, 1977.
104. Senthilkumar, R; Sahhabudeem, R GA based heuristic for the open shop scheduling problem. Intern JAdv Man Technol, 2006, 30 (3-4), 297-301.
105. Sharma, B.; Yao, X Characterizing genetic algorithm approaches to job shop scheduling. UK Workshop on Computational Intelligence, Loughborough University, 2004.
106. Sridhar, J.; Rajendran, C. Scheduling in flowshop and cellular manufacturing systems with multiobjectives -a genetic algorithmic approach. Prod Plann Control, 2007, 7, 734-382.
107. Sivrikaya Serifoglu, E; Ulusoy, G. Multiprocessor task scheduling in multistage hybrid flow shops: A genetic algorithm approach. /Oper Res Soc, 2004, 55, 504-512.
108. Storer, R.H.; Wu, S.D.; Vaccari, R. New search spaces for sequencing problems with applications to job-shop scheduling. Management Sci, 1992, 38, 453-467.
109. Sun, Y; Zhang, C; Gao, L.; Wang X. Multi-objective optimization algorithms for flow shop scheduling problem: a review and prospects. Int J Adv Manuf Technol, 2011, 55, 723-739.
110. Syswerda, G. Schedule optimization using genetic algorithms. In: L. Davis (ed.), Handbook of Genetic Algorithms, 1990, 332-349.
111. Taillard, E. Benchmarks for basic scheduling problems. Eur J Oper Res, 1993, 64, 278-285.
112. Tang, L.; Liu, J. A modified genetic algorithm for the flow shop sequencing problem to minimize mean flow time. J Int Manuf, 2002, 13, 61-67.
113. Tseng, L.-Y.; Lin, Y.-T. A hybrid genetic local search algorithm for the permutation flowshop scheduling problem. Eur J Oper Res, 2009, 198, 84-92.
114. Uysal, O.; Bulkan, S. Comparison of genetic algorithm and particle swarm optimization for bicriteria permutation flowshop scheduling problem. Int J Comp Intell Res, 2008, 4, 159-175.
115. Vallada, E.; Ruiz, R. Genetic algorithms with path relinking for the minimum tardiness permutation flow shop problem. Omega, 2010, 38, 57-67.
116. Vallada, E.; Ruiz, R.; Minella, G. Minimising total tardiness in the m-machine flow-shop problem: A review and evaluation of heuristics and metaheuristics. Comp Oper Res, 2008, 35, 1350-1373.
117. Vazquez, M.; Whitley, L.D. A comparison of genetic algorithms for the static job shop scheduling problem. Lecture Notes Comp Sci, 2000, 1917, 303-312.
118. Vazquez, M.; Whitley, L.D. A comparison of genetic algorithms for the dynamic job shop scheduling problem. Genetic and Evolutionary Computation Conference, 2000, 1011-1018.
119. Vela, C.R.; Varela, R.; Gonzalez, M.A. Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times. J Heuristics, 2010, 16, 139-165.
120. Wang, W.; Brunn, R An effective genetic algorithm for job shop scheduling. Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture, 2000, 214 (4), 293-300.
121. Wang, L.; Zheng, D.-Z. A modified genetic algorithm for job shop scheduling. Int J Adv ManufTechnol, 2006, 27, 1021-1029.
122. Werner, F. On the solution of special sequencing problems. Ph.D. Thesis, TU Magdeburg, 1984 (in German).
123. Werner, F. An adaptive stochastic search procedure for special scheduling problems. Economicko-Matematicky Obzor, 1988, 24, 50-67 (in German).
124. Werner, F. On the structure and approximate solution of special combinatorial optimization problems. Habilitation Thesis, TU Magdeburg, 1989 (in German).
125. Werner, F. Some relations between neighborhood graphs for a permutation problem. Optimization, 1991, 22, 297-306.
126. Werner, F. On the heuristic solution of the permutation flow shop problem by path algorithms. Comp Oper Res, 1993, 20, 707-722.
127. Werner, F. Genetic algorithms for shop scheduling problems: A survey. Preprint 11-31, FMA, OvGU Magdeburg, 2011, 66 p.
128. Xie, H. A genetic algorithm approach to job shop scheduling problems with a batch allocation issue. Proceedings of the 17th International Workshop on Artificial Intelligence, Seattle, 2001, 126-131.
129. Xing, Y.J.; Wang, Z.Q.; Sun, J.; Meng, J.J. A multi-objective fuzzy genetic algorithm for job-shop scheduling problems. Journal of Achievements in Materials and Manufacturing Engineering, 2006, 17, 297-300.
130. Yamada, T.; Nakano, R. A genetic algorithm applicable to large-scale job-shop problems. Parallel Problem Solving from Nature, 1992, 2, 281-290.
131. Yamada, T.; Nakano, R. A genetic algorithm with multi-step crossover for job-shop scheduling problems. GALESIA' 95, 1995, 146-151.
132. Yamada, T.; Nakano, R. Scheduling by genetic local search with multi-step crossover. Fourth International Conference on Parallel Problem Solving from Nature (PPSNIV), 1996, 960-969.
133. Yamada, T.; Nakano, R. Genetic algorithms for job-shop scheduling problems. Proceedings of Modern Heuristic for Decision Support, London, 1997, 67-81.
134. Yaurima, V.; Burtseva, L.; Tchernykh, A. Hybrid flowshop with unrelated machines, sequence-dependent setup time, availability constraints and limited buffers. Comput Ind Engng, 2008.
135. Zandieh, M.; Mozaffari, E.; Gholami, M. A robust genetic algorithm for scheduling realistic hybrid flexible flow line problems. J Intell Manufi 2010, 21, 731-743.
136. Zhan Y.; Qiu, C.H.; Xue, K. A hybrid genetic algorithm for hybrid flow shop scheduling with load balancing. Key Engineering Materials, 2009, 392-394, pp. 250-255.
137. Zhang, H.; Gen, M. Multistage-based genetic algorithm for flexible job-shop scheduling problem. Journal Complexity International, 2005, 11, 223-232.
138. Zhang, R.; Wu, C. An immune genetic algorithm based on bottleneck jobs for the job shop scheduling problem. Proceedings ofEvoCOP 2008, Lecture Notes Comp Sci, 2008, 4972, 147-157.