The hybrid flow shop scheduling problem

European Journal of Operational Research

Volumn 205, Issue 1, 2010, Pages 1-18

  Ruiz, Rubén ^a   Vázquez Rodríguez, José Antonio ^b  

^a INSTITUTO TECNOLÓGICO DE INFORMÁTICA   (Spain)

^b Nottingham University Jubilee Campus   (United Kingdom)

Author keywords

Hybrid flow shop; Review; Scheduling

Indexed keywords

COMPLEX COMBINATORIAL PROBLEM; FLOW-SHOPS; HYBRID FLOW SHOP; HYBRID FLOW SHOP SCHEDULING; LITERATURE REVIEWS; META-HEURISTIC METHODS; OBJECTIVE FUNCTIONS; PARALLEL MACHINE; REAL-WORLD APPLICATION; RESEARCH OPPORTUNITIES;

MACHINE SHOP PRACTICE; PARALLEL FLOW; SCHEDULING;

HEURISTIC METHODS;

EID: 75849147656     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2009.09.024     Document Type: Review

References (225)

1. M.J. Acero-Domfnguez, C.D. Patermina-Arboleda, Scheduling jobs on a k-stage flexible flow shop using a toc-based (bottleneck) procedure, in: M.H. Jones, S.D. Patek, B.E. Tawney (Eds.), Proceedings of the 2004 Systems and Information Engineering Design Symposium, IEEE Press, 2004, pp. 295-298.
2. Adler L., Fraiman N., Kobacker E., Pinedo M., Plotnicoff J.C., and Wu T.P. Bpss: a scheduling support system for the packaging industry. Operations Research 41 4 (1993) 641-648
3. E.-H. Aghezzaf, A. Artiba, O. Moursli, C. Tahon, Hybrid flowshop problems, a decomposition based heuristic approach, in: Proceedings of the International Conference on Industrial Engineering and Production Management, IEPM'95, FUCAM-INRIA, 1995, pp. 43-56.
4. Aghezzaf E.-H., and Van Landeghem H. An integrated model for inventory and production planning in a two-stage hybrid production system. International Journal of Production Research 40 17 (2002) 4323-4339
5. Agnetis A., Pacifici A., Rossi F., Lucertini M., Nicoletti S., Nicolo F., Oriolo G., Pacciarelli D., and Pesaro E. Scheduling of flexible flow lines in an automobile assembly plant. European Journal of Operational Research 97 2 (1997) 348-362
6. Alaykyran K., Engin O., and Doyen A. Using ant colony optimization to solve hybrid flow shop scheduling problems. International Journal of Advanced Manufacturing Technology 35 5-6 (2007) 541-550
7. Alfieri A. Workload simulation and optimisation in multi-criteria hybrid flowshop scheduling: a case study. International Journal of Production Research 47 18 (2009) 5129-5145
8. Allahverdi A., and Al-Anzi F.S. Scheduling multi-stage parallel-processor services to minimize average response time. Journal of the Operational Research Society 57 1 (2006) 101-110
9. Allahverdi A., Ng C.T., Cheng T.C.E., and Kovalyov M.Y. A survey of scheduling problems with setup times or costs. European Journal of Operational Research 187 3 (2008) 985-1032
10. Allahverdi H.M., and Soroush A. The significance of reducing setup times/setup costs. European Journal of Operational Research 187 3 (2008) 978-984
11. Allaoui H., and Artiba A. Integrating simulation and optimization to schedule a hybrid flow shop with maintenance constraints. Computers and Industrial Engineering 47 4 (2004) 431-450
12. Allaoui H., and Artiba A. Scheduling two-stage hybrid flow shop with availability constraints. Computers and Operations Research 33 5 (2006) 1399-1419
13. Andres C., Albarracin J.M., Tormo G., Vicens E., and Garcia-Sabater J.P. Group technology in a hybrid flowshop environment: a case study. European Journal of Operational Research 167 1 (2005) 272-281
14. Arthanary T.S., and Ramaswamy K.G. An extension of two machine sequencing problem. OPSEARCH: The Journal of the Operational Research Society of India 8 4 (1971) 10-22
15. Azizoglu M., Cakmak E., and Kondakci S. A flexible flowshop problem with total flow time minimization. European Journal of Operational Research 132 3 (2001) 528-538
16. Babayan A., and He D. Solving the n-job three-stage flexible flowshop scheduling problem using an agent-based approach. International Journal of Production Research 42 4 (2004) 777-799
17. Bellanger A., and Oulamara A. Scheduling hybrid flowshop term with parallel batching machines and compatibilities. Computers and Operations Research 36 6 (2009) 1982-1992
18. Bertel S., and Billaut J.-C. A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation. European Journal of Operational Research 159 3 (2004) 651-662
19. Bolat A., Al-Harkan I., and Al-Harbi B. Flow-shop scheduling for three serial stations with the last two duplicate. Computers and Operations Research 32 3 (2005) 647-667
20. V. Botta-Genoulaz, Considering bills of material in hybrid flow shop scheduling problems, in: IEEE International Symposium on Assembly and Task Planning, ISATP 97, IEEE Press, 1997, pp. 194-199.
21. Botta-Genoulaz V. Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness. International Journal of Production Economics 64 1-3 (2000) 101-111
22. S.A. Brah, Scheduling in a Flow Shop with Multiple Processors, Thesis/Dissertation, University of Houston, 1988.
23. Brah S.A. A comparative analysis of due date based job sequencing rules in a flow shop with multiple processors. Production Planning and Control 7 4 (1996) 362-373
24. Brah S.A., and Hunsucker J.L. Branch and bound algorithm for the flow-shop with multiple processors. European Journal of Operational Research 51 1 (1991) 88-99
25. Brah S.A., and Loo L.L. Heuristics for scheduling in a flow shop with multiple processors. European Journal of Operational Research 113 1 (1999) 113-122
26. Brah S.A., and Wheeler G.E. Comparison of scheduling rules in a flow shop with multiple processors: a simulation. Simulation 71 5 (1998) 302-311
27. Bratley P., Florian M., and Robillard P. Scheduling with earliest start and due date constraints on multiple machines. Naval Research Logistics Quearterly 22 1 (1975) 165-173
28. Caricato P., Grieco A., and Serino D. TSP-based scheduling in a batch-wise hybrid flow-shop. Robotics and Computer-Integrated Manufacturing 23 2 (2007) 234-241
29. Carlier J., and NTron E. An exact method for solving the multi-processor flow-shop. RAIRO Recherche OpTrationnelle 34 1 (2000) 1-25
30. Chang S.-C., and Liao D.-Y. Scheduling flexible flow shops with no setup effects. IEEE Transactions on Robotics and Automation 10 2 (1994) 112-122
31. Chen B. Analysis of classes of heuristics for scheduling a two-stage flow-shop with parallel machines at one stage. Journal of the Operational Research Society 46 2 (1995) 234-244
32. Chen C.L., and Chen C.L. Bottleneck-based heuristics to minimize tardy jobs in a flexible flow line with unrelated parallel machines. International Journal of Production Research 46 22 (2008) 6415-6430
33. Chen C.L., and Chen C.L. Bottleneck-based heuristics to minimize total tardiness for the flexible flow line with unrelated parallel machines. Computers and Industrial Engineering 56 4 (2009) 1393-1401
34. Chen C.L., Usher J.M., and Palanimuthu N. A tabu search based heuristic for a flexible flow line with minimum flow time criterion. International Journal of Industrial Engineering-Theory Applications and Practice 5 2 (1998) 157-168
35. Chen L., Bostel N., Dejax P., Cai J.C., and Xi L.F. A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal. European Journal of Operational Research 181 1 (2007) 40-58
36. Chen L., Xi L.-F., Cai J.-G., Bostel N., and Dejax P. An integrated approach for modeling and solving the scheduling problem of container handling systems. Journal of Zhejiang University Science A 7 2 (2006) 234-239
37. Cheng J.L., Karuno Y., and Kise H. A shifting bottleneck approach for a parallel-machine flowshop scheduling problem. Journal of the Operations Research Society of Japan 44 2 (2001) 140-156
38. Choi H.S., and Lee D.H. Scheduling algorithms to minimize the number of tardy jobs in two-stage hybrid flow shops. Computers and Industrial Engineering 56 1 (2009) 113-120
39. Choi S.-W., Kim Y.-D., and Lee G.-C. Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop. International Journal of Production Research 43 11 (2005) 2149-2167
40. Deal D.E., Yang T., and Hallquist S. Job scheduling in petrochemical production: two-stage processing with finite intermediate storage. Computers and Chemical Engineering 18 4 (1994) 333-344
41. Dessouky M.M., Dessouky M.I., and Verma S.K. Flowshop scheduling with identical jobs and uniform parallel machines. European Journal of Operational Research 109 3 (1998) 620-631
42. Ding F.Y., and Kittichartphayak D. Heuristics for scheduling flexible flow lines. Computers and Industrial Engineering 26 1 (1994) 27-34
43. Djellab H., and Djellab K. Preemptive hybrid flowshop scheduling problem of interval orders. European Journal of Operational Research 137 1 (2002) 37-49
44. Dror M., and Mullaserif P.A. Three stage generalized flowshop: scheduling civil engineering projects. Journal of Global Optimization 9 3-4 (1996) 321-344
45. Engin O., and Doyen A. A new approach to solve hybrid flow shop scheduling problems by artificial immune system. Future Generation Computer Systems 20 6 (2004) 1083-1095
46. Figielska E. A new heuristic for scheduling the two-stage flowshop with additional resources. Computers and Industrial Engineering 54 4 (2008) 750-763
47. Figielska E. A genetic algorithm and a simulated annealing algorithm combined with column generation technique for solving the problem of scheduling in the hybrid flowshop with additional resources. Computers and Industrial Engineering 56 1 (2009) 142-151
48. Finke D.A., Medeiros D.J., and Traband M.T. Multiple machine jit scheduling: a tabu search approach. International Journal of Production Research 45 21 (2007) 4899-4915
49. Garey M.R., and Johnson D.S. Computers and intractability: a guide to the theory of NP-completeness. A Series of Books in the Mathematical Sciences (1979), W.H. Freeman, San Francisco
50. Gooding W.B., Pekny J.F., and Mccroskey P.S. Enumerative approaches to parallel flowshop scheduling via problem transformation. Computers and Chemical Engineering 18 10 (1994) 909-927
51. M. Gourgand, N. Grangeon, S. Norre, Metaheuristics for the deterministic hybrid flow shop problem, in: Proceedings of the International Conference on Industrial Engineering and Production Management, IEPM'99, FUCAM-INRIA, 1999, pp. 136-145.
52. Grabowski J., and Pempera J. Sequencing of jobs in some production system. European Journal of Operational Research 125 3 (2000) 535-550
53. Grangeon N., Tanguy A., and Tchernev N. Generic simulation model for hybrid flow-shop. Computers and Industrial Engineering 37 1-2 (1999) 207-210
54. Gue K.R., Nemhauser G.L., and Padron M. Production scheduling in almost continuous time. IIE Transactions 29 5 (1997) 391-398
55. Guinet A.G.P., and Solomon M.M. Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time. International Journal of Production Research 34 6 (1996) 1643-1654
56. Guinet A.G.P., Solomon M.M., Kedia P.K., and Dussauchoy A. A computational study of heuristics for two-stage flexible flowshops. International Journal of Production Research 34 5 (1996) 1399-1415
57. Guirchoun S., Martineau P., and Billaut J.-C. Total completion time minimization in a computer system with a server and two parallel processors. Computers and Operations Research 32 3 (2005) 599-611
58. Gupta J.N.D. Two-stage, hybrid flow shop scheduling problem. Journal of the Operational Research Society 39 4 (1988) 359-364
59. Gupta J.N.D., Hariri A.M.A., and Potts C.N. Scheduling a two-stage hybrid flow shop with parallel machines at the first stage. Annals of Operations Research 69 (1997) 171-191
60. Gupta J.N.D., Kruger K., Lauff V., Werner F., and Sotskov Y.N. Heuristics for hybrid flow shops with controllable processing times and assignable due dates. Computers and Operations Research 29 10 (2002) 1417-1439
61. Gupta J.N.D., Sexton R.S., and Tunc E.A. Selecting scheduling heuristics using neural networks. Informs Journal on Computing 12 2 (2000) 150-162
62. Gupta J.N.D., and Tunc E.A. Schedules for a two-stage hybrid flowshop with parallel machines at the second stage. International Journal of Production Research 29 7 (1991) 1489-1502
63. Gupta J.N.D., and Tunc E.A. Scheduling a two-stage hybrid flowshop with separable setup and removal times. European Journal of Operational Research 77 3 (1994) 415-428
64. Gupta J.N.D., and Tunc E.A. Minimizing tardy jobs in a two-stage hybrid flowshop. International Journal of Production Research 36 9 (1998) 2397-2417
65. Haouari M., and Hidri L. On the hybrid flowshop scheduling problem. International Journal of Production Economics 113 1 (2008) 495-497
66. Haouari M., Hidri L., and Gharbi A. Optimal scheduling of a two-stage hybrid flow shop. Mathematical Methods of Operations Research 64 1 (2006) 107-124
67. Haouari M., and M'Hallah R. Heuristic algorithms for the two-stage hybrid flowshop problem. Operations Research Letters 21 1 (1997) 43-53
68. J.T. Havill, W. Mao, On-line algorithms for hybrid flow shop scheduling problems, in: Proceedings of the Fourth International Conference on Computer Science and Informatics, 1998, pp. 134-137.
69. He D., and Babayan A. Scheduling manufacturing systems for delayed product differentiation in agile manufacturing. International Journal of Production Research 40 11 (2002) 2461-2481
70. He D., Babayan A., and Kusiak A. Scheduling manufacturing systems in an agile environment. Robotics and Computer Integrated Manufacturing 17 1-2 (2001) 87-97
71. He D.W., Kusiak A., and Artiba A. A scheduling problem in glass manufacturing. IIE Transactions 28 2 (1996) 129-139
72. Hong T.P., and Wang T.T. Fuzzy flexible flow shops at two machine centers for continuous fuzzy domains. Information Sciences 129 1-4 (2000) 227-237
73. Hong T.P., Wang T.T., and Wang S.L. A palmer-based continuous fuzzy flexible flow-shop scheduling algorithm. International Journal of Soft Computing 5 6 (2001) 426-433
74. Hoogeveen J.A., Lenstra J.K., and Veltman B. Preemptive scheduling in a two-stage multiprocessor flow shop is np-hard. European Journal of Operational Research 89 1 (1996) 172-175
75. Huang W., and Li S. A two-stage hybrid flowshop with uniform machines and setup times. Mathematical and Computer Modelling 27 2 (1998) 27-45
76. Huang Y.M., and Shiau D.F. Combined column generation and constructive heuristic for a proportionate flexible flow shop scheduling. International Journal of Advanced Manufacturing Technology 38 7-8 (2008) 691-704
77. Hunsucker J.L., and Shah J.R. Performance of priority rules in a due date flow-shop. Omega-International Journal of Management Science 20 1 (1992) 73-89
78. Hunsucker J.L., and Shah J.R. Comparative performance analysis of priority rules in a constrained flow-shop with multiple processors environment. European Journal of Operational Research 72 1 (1994) 102-114
79. Janiak A., Kozan E., Lichtenstein M., and Oguz C. Metaheuristic approaches to the hybrid flow shop scheduling problem with a cost-related criterion. International Journal of Production Economics 105 2 (2007) 407-424
80. Jayamohan M.S., and Rajendran C. A comparative analysis of two different approaches to scheduling in flexible flow shops. Production Planning and Control 11 6 (2000) 572-580
81. Jenabi M., Fatemi Ghomi S.M.T., Torabi S.A., and Karimi B. Two hybrid meta-heuristics for the finite horizon elsp in flexible flow lines with unrelated parallel machines. Applied Mathematics and Computation 186 1 (2007) 230-245
82. M.T. Jensen, Robust and Flexible Scheduling with Evolutionary Computation, Ph.D. Thesis, Department of Computer Science, University of Aarhus, 2001.
83. Jin Z.H., Ohno K., Ito T., and Elmaghraby S.E. Scheduling hybrid flowshops in printed circuit board assembly lines. Production and Operations Management 11 2 (2002) 216-230
84. Jin Z.H., Yang Z., and Ito T. Metaheuristic algorithms for the multistage hybrid flowshop scheduling problem. International Journal of Production Economics 100 2 (2006) 322-334
85. Jungwattanakit J., Reodecha M., Chaovalitwongse P., and Werner F. Algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria. International Journal of Advanced Manufacturing Technology 37 3-4 (2008) 354-370
86. Jungwattanakit J., Reodecha M., Chaovalitwongse P., and Werner F. A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria. Computers and Operations Research 36 2 (2009) 358-378
87. Kaczmarczyky W., Sawik T.J., Schaller A., and Tirpak T.M. Optimal versus heuristic scheduling of surface mount technology lines. International Journal of Production Research 42 10 (2004) 2083-2110
88. Kadipasaoglu S.N., Xiang W., and Khumawala B.M. A comparison of sequencing rules in static and dynamic hybrid flow systems. International Journal of Production Research 35 5 (1997) 1359-1384
89. Kadipasaoglu S.N., Xiang W., and Khumawala B.M. A note on scheduling hybrid flow systems. International Journal of Production Research 35 5 (1997) 1491-1494
90. Kim J.S., Kang S.H., and Lee S.M. Transfer batch scheduling for a two-stage flowshop with identical parallel machines at each stage. Omega-International Journal of Management Science 25 5 (1997) 547-555
91. Kim Y.-D., Joo B.-J., and Shin J.-H. Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint. Journal of Heuristics 15 1 (2009) 19-42
92. Kis T., and Pesch E. A review of exact solution methods for the non-preemptive multiprocessor flowshop problem. European Journal of Operational Research 164 3 (2005) 592-608
93. Kochhar S., and Morris R.J.T. Heuristic methods for flexible flow line scheduling. Journal of Manufacturing Systems 6 4 (1987) 299-314
94. Kochhar S., Morris R.J.T., and Wong W.S. The local search approach to flexible flow line scheduling. Engineering Costs and Production Economics 14 1 (1988) 25-37
95. Koulamas C., and Kyparisis G.J. Asymptotically optimal linear time algorithms for two-stage and three-stage flexible flow shops. Naval Research Logistics 47 3 (2000) 259-268
96. Koulamas C., and Kyparisis G.J. A note on performance guarantees for sequencing three-stage flexible flowshops with identical machines to minimize makespan. IIE Transactions 39 5 (2007) 559-563
97. Kouvelis P., and Vairaktarakis G. Flowshops with processing flexibility across production stages. IIE Transactions 30 8 (1998) 735-746
98. Kuo Y., Yang T., Cho C., and Tseng Y.C. Using simulation and multi-criteria methods to provide robust solutions to dispatching problems in a flow shop with multiple processors. Mathematics and Computers in Simulation 78 1 (2008) 40-56
99. Kurz M.E., and Askin R.G. An adaptable problem-space-based search method for flexible flow line scheduling. IIE Transactions 33 8 (2001) 691-693
100. Kurz M.E., and Askin R.G. Comparing scheduling rules for flexible flow lines. International Journal of Production Economics 85 3 (2003) 371-388
101. Kurz M.E., and Askin R.G. Scheduling flexible flow lines with sequence-dependent setup times. European Journal of Operational Research 159 1 (2004) 66-82
102. Kyparisis G.J., and Koulamas C. A note on weighted completion time minimization in a flexible flow shop. Operations Research Letters 29 1 (2001) 5-11
103. Kyparisis G.J., and Koulamas C. Flexible flow shop scheduling with uniform parallel machines. European Journal of Operational Research 168 3 (2006) 985-997
104. Kyparisis G.J., and Koulamas C. A note on makespan minimization in two-stage flexible flow shops with uniform machines. European Journal of Operational Research 175 2 (2006) 1321-1327
105. Lee C.Y., and Vairaktarakis G.L. Minimizing makespan in hybrid flowshops. Operations Research Letters 16 3 (1994) 149-158
106. Lee C.Y., and Vairaktarakis G.L. Performance comparison of some classes of flexible flow shops and job shops. International Journal of Flexible Manufacturing Systems 10 4 (1998) 379-405
107. Lee G.C. Estimating order lead times in hybrid flowshops with different scheduling rules. Computers and Industrial Engineering 56 4 (2009) 1668-1674
108. Lee G.-C., and Kim Y.-D. A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness. International Journal of Production Research 42 22 (2004) 4731-4743
109. Lee Y.-D., Kim G.-C., and Choi S.-W. Bottleneck-focused scheduling for a hybrid flowshop. International Journal of Production Research 42 1 (2004) 165-181
110. Leon V.J., and Ramamoorthy B. An adaptable problem-space-based search method for flexible flow line scheduling. IIE Transactions 29 2 (1997) 115-125
111. Li S.L. A hybrid two-stage flowshop with part family, batch production, major and minor set-ups. European Journal of Operational Research 102 1 (1997) 142-156
112. Lin H.-T., and Liao C.-J. A case study in a two-stage hybrid flow shop with setup time and dedicated machines. International Journal of Production Economics 86 2 (2003) 133-143
113. Linn R., and Zhang W. Hybrid flow shop scheduling: a survey. Computers and Industrial Engineering 37 1-2 (1999) 57-61
114. Liu C.-Y., and Chang S.-C. Scheduling flexible flow shops with sequence-dependent setup effects. IEEE Transactions on Robotics and Automation 16 4 (2000) 408-419
115. Liu J.Y. Single-job lot streaming in m-1 two-stage hybrid flowshops. European Journal of Operational Research 187 3 (2008) 1171-1183
116. Liu Y., and Karimi I.A. Scheduling multistage batch plants with parallel units and no interstage storage. Computers and Chemical Engineering 32 4-5 (2008) 671-693
117. Logendran R., Carson S., and Hanson E. Group scheduling in flexible flow shops. International Journal of Production Economics 96 2 (2005) 143-155
118. Logendran R., deSzoeke P., and Barnard F. Sequence-dependent group scheduling problems in flexible flow shops. International Journal of Production Economics 102 1 (2006) 66-86
119. Low C.Y. Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines. Computers and Operations Research 32 8 (2005) 2013-2025
120. Low C.Y., Hsu C.J., and Su C.T. A two-stage hybrid flowshop scheduling problem with a function constraint and unrelated alternative machines. Computers and Operations Research 35 3 (2008) 845-853
121. Braglia M., and Petroni A. Data envelopment analysis for dispatching rule selection. Production Planning and Control 10 5 (1999) 454-461
122. Minella G., Ruiz R., and Ciavotta M. A review and evaluation of multi-objective algorithms for the flowshop scheduling problem. INFORMS Journal on Computing 20 3 (2008) 451-471
123. Mittal B.S., and Bagga P.C. Two machine sequencing problem with parallel machines. OPSEARCH: Journal of the Operational Research Society of India 10 (1973) 50-61
124. Morita H., and Shio N. Hybrid branch and bound method with genetic algorithm for flexible flowshop scheduling problem. JSME International Journal Series C-Mechanical Systems Machine Elements and Manufacturing 48 1 (2005) 46-52
125. Moursli O., and Pochet Y. A branch-and-bound algorithm for the hybrid flowshop. International Journal of Production Economics 64 1-3 (2000) 113-125
126. Naderi B., Zandieh M., Khaleghi Ghoshe Balagh A., and Roshanaei V. An improved simulated annealing for hybrid flowshops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness. Expert Systems with Applications 36 6 (2009) 9625-9633
127. Naderi B., Zandieh M., and Roshanaei V. Scheduling hybrid flowshops with sequence dependent setup times to minimize makespan and maximum tardiness. International Journal of Advanced Manufacturing Technology 41 11-12 (2009) 1186-1198
128. Narasimhan S.L., and Mangiameli P.M. A comparison of sequencing rules for a two-stage hybrid flowshop. Decision Sciences 18 2 (1987) 250-265
129. Narasimhan S.L., and Panwalkar S.S. Scheduling in a two-stage manufacturing process. International Journal of Production Research 22 4 (1984) 555-564
130. Negenman E.G. Local search algorithms for the multiprocessor flow shop scheduling problem. European Journal of Operational Research 128 1 (2001) 147-158
131. Nowicki E., and Smutnicki C. The flow shop with parallel machines: a tabu search approach. European Journal of Operational Research 106 2-3 (1998) 226-253
132. NTron E., Baptiste P., and Gupta J.N.D. Solving hybrid flow shop problem using energetic reasoning and global operations. Omega-International Journal of Management Science 29 6 (2001) 501-511
133. Oguz C., and Ercan M. A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks. Journal of Scheduling 8 4 (2005) 323-351
134. Oguz C., and Ercan M.F. Scheduling multiprocessor tasks in a two-stage flow-shop environment. Computers and Industrial Engineering 33 1-2 (1997) 269-272
135. Oguz C., Ercan M.F., Cheng T.C.E., and Fung Y.F. Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop. European Journal of Operational Research 149 2 (2003) 390-403
136. Oguz C., Zinder Y., Do V., Janiak A., and Lichtenstein M. Hybrid flow-shop scheduling problems with multiprocessor task systems. European Journal of Operational Research 152 1 (2004) 115-131
137. Guinet A.G.P. Textile production systems: a succession of non-identical parallel processor shops. Journal of the Operational Research Society 42 8 (1991) 655-671
138. Paul R.J. Production scheduling problem in the glass-container industry. Operations Research 27 2 (1979) 290-302
139. Pearn W.L., Chung S.H., Yang M.H., and Chen C.Y. The integrated circuit packaging scheduling problem (icpsp): a case study. International Journal of Industrial Engineering-Theory Applications and Practice 12 3 (2005) 296-307
140. Phadnis S., Brevick J., and Irani S. Development of a new heuristic for scheduling flow-shops with parallel machines by prioritizing bottleneck stages. Journal of Integrated Design and Process Science 7 1 (2003) 87-97
141. Pinedo M. Scheduling: Theory Algorithms and Systems. second ed. (2002), Prentice Hall, Upper Saddle, NJ
142. Piramuthu S., Raman N., and Shaw M.J. Learning-based scheduling in a flexible manufacturing flow line. IEEE Transactions on Engineering Management 41 2 (1994) 172-182
143. Piramuthu S., Raman N., and Shaw M.J. Decision support system for scheduling a flexible flow system: incorporation of feature construction. Annals of Operations Research 78 (1998) 219-234
144. Portmann M.C., Vignier A., Dardilhac D., and Dezalay D. Branch and bound crossed with GA to solve hybrid flowshops. European Journal of Operational Research 107 2 (1998) 389-400
145. Quadt D., and Kuhn D. A taxonomy of flexible flow line scheduling procedures. European Journal of Operational Research 178 3 (2007) 686-698
146. Rajendran C., and Chaudhuri D. A multistage parallel-processor flowshop problem with minimum flowtime. European Journal of Operational Research 57 1 (1992) 111-122
147. Rajendran C., and Chaudhuri D. Scheduling in n-jobs m stage flowshop with parallel processors to minimize makespan. International Journal of Production Economics 27 2 (1992) 137-143
148. Rao T.B.K. Sequencing in the order a, b, with multiplicity of machines for a single operation. OPSEARCH: Journal of the Operational Research Society of India 7 (1970) 135-144
149. Riane F., Artiba A., and Elmaghraby S.E. A hybrid three-stage flowshop problem: efficient heuristics to minimize makespan. European Journal of Operational Research 109 2 (1998) 321-329
150. Riane F., Artiba A., and Elmaghraby S.E. Sequencing a hybrid two-stage flowshop with dedicated machines. International Journal of Production Research 40 17 (2002) 4353-4380
151. Riane F., Artiba A., and Iassinovski S. An integrated production planning and scheduling system for hybrid flowshop organizations. International Journal of Production Economics 74 1-3 (2001) 33-48
152. Ruiz R., and Maroto C. A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility. European Journal of Operational Research 169 3 (2006) 781-800
153. Ruiz R., Serifoglu F.S., and Urlings T. Modeling realistic hybrid flexible flowshop scheduling problems. Computers and Operations Research 35 4 (2008) 1151-1175
154. M.S. Salvador, A solution to a special case of flow shop scheduling problems, in: S.E. Elmaghraby (Ed.), Symposium of the Theory of Scheduling and Applications, Springer-Verlag, 1973, pp. 83-91.
155. Santos D.L., Hunsucker J.L., and Deal D.E. Flowmult: permutation sequences for flow shops with multiple processors. Journal of Information and Optimization Sciences 16 2 (1995) 351-366
156. Santos D.L., Hunsucker J.L., and Deal D.E. Global lower bounds for flow shops with multiple processors. European Journal of Operational Research 80 1 (1995) 112-120
157. Santos D.L., Hunsucker J.L., and Deal D.E. An evaluation of sequencing heuristics in flow shops with multiple processors. Computers and Industrial Engineering 30 4 (1996) 681-691
158. Santos D.L., Hunsucker J.L., and Deal D.E. On makespan improvement in flow shops with multiple processors. Production Planning and Control 12 3 (2001) 283-295
159. Sawik T. Integer programming approach to reactive scheduling in make-to-order manufacturing. Mathematical and Computer Modelling 46 11-12 (2007) 1373-1387
160. Sawik T.J. A scheduling algorithm for flexible flow lines with limited intermediate buffers. Applied Stochastic Models and Data Analysis 9 2 (1993) 127-138
161. Sawik T.J. Scheduling flexible flow lines with no in-process buffers. International Journal of Production Research 33 5 (1995) 1357-1367
162. Sawik T.J. Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers. Mathematical and Computer Modelling 31 13 (2000) 39-52
163. Sawik T.J. Mixed integer programming for scheduling surface mount technology lines. International Journal of Production Research 39 14 (2001) 3219-3235
164. Sawik T.J. An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers. Mathematical and Computer Modelling 36 4-5 (2002) 461-471
165. Sawik T.J. Integer programming approach to production scheduling for make-to-order manufacturing. Mathematical and Computer Modelling 41 1 (2005) 99-118
166. Sawik T.J., Schaller A., and Tirpak T.M. Scheduling of printed wiring board assembly in surface mount technology lines. Journal of Electronics Manufacturing 11 1 (2002) 1-17
167. Schuurman P., and Woeginger G.J. A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem. Theoretical Computer Science 237 1-2 (2000) 105-122
168. Serifoglu F.S., and Ulusoy G. Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach. Journal of the Operational Research Society 55 5 (2004) 504-512
169. Sevastianov S.V. Geometrical heuristics for multiprocessor flowshop scheduling with uniform machines at each stage. Journal of Scheduling 5 3 (2002) 205-225
170. Sherali H.D., Sarin S.C., and Kodialam M.S. Models and algorithms for a two-stage production process. Production Planning and Control 1 1 (1990) 27-39
171. Shiau D.F., Cheng S.C., and Huang Y.M. Proportionate flexible flow shop scheduling via a hybrid constructive genetic algorithm. Expert Systems with Applications 34 2 (2008) 1133-1143
172. Sirikrai V., and Yenradee P. Modified drum-buffer-rope scheduling mechanism for a non-identical parallel machine flow shop with processing-time variation. International Journal of Production Research 44 17 (2006) 3509-3531
173. Soewandi H., and Elmaghraby S.E. Sequencing three-stage flexible flowshops with identical machines to minimize makespan. IIE Transactions 33 11 (2001) 985-993
174. Soewandi H., and Elmaghraby S.E. Sequencing on two-stage hybrid flowshops with uniform machines to minimize makespan. IIE Transactions 35 5 (2003) 467-477
175. Sriskandarajah C., and Sethi S.P. Scheduling algorithms for flexible flowshops: worst and average case performance. European Journal of Operational Research 43 2 (1989) 143-160
176. Sundararaghavan P.S., Kunnathur A.S., and Viswanathan I. Minimizing makespan in parallel flowshops. Journal of the Operational Research Society 48 8 (1997) 834-842
177. Sung C.S., and Kim H.A. A two-stage multiple-machine assembly scheduling problem for minimizing sum of completion times. International Journal of Production Economics 113 2 (2008) 1038-1048
178. Suresh V. A note on scheduling of two-stage flow shop with multiple processors. International Journal of Production Economics 49 1 (1997) 77-82
179. Takaku K., and Yura K. Online scheduling aiming to satisfy due date for flexible flow shops. JSME International Journal Series C-Mechanical Systems Machine Elements and Manufacturing 48 1 (2005) 21-25
180. Tang L.X., Liu W.X., and Liu J.Y. A neural network model and algorithm for the hybrid flow shop scheduling problem in a dynamic environment. Journal of Intelligent Manufacturing 16 3 (2005) 361-370
181. Tang L.X., and Xuan H. Lagrangian relaxation algorithms for real-time hybrid flowshop scheduling with finite intermediate buffers. Journal of the Operational Research Society 57 3 (2006) 316-324
182. Tang L.X., Xuan H., and Liu J.Y. A new lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time. Computers and Operations Research 33 11 (2006) 3344-3359
183. L.X. Tang, Y. Zhang, J. Wang, X. Liao, Z. Yi, Heuristic combined artificial neural networks to schedule hybrid flow shop with sequence dependent setup times, in: J. Wang, X. Liao, Z. Yi (Eds.), Advances in Neural Networks - ISNN 2005, Second International Symposium on Neural Networks, Volume 3496 of Lecture Notes in Computer Science, Springer Berlin/ Heidelberg, 2005, pp. 788-793.
184. Tavakkoli-Moghaddam R., Safaei N., and Sassani F. A memetic algorithm for the flexible flow line scheduling problem with processor blocking. Computers and Operations Research 36 2 (2009) 402-414
185. Thornton H.W., and Hunsucker J.L. A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage. European Journal of Operational Research 152 1 (2004) 96-114
186. T'kindt V., and Billaut J.-C. Multicriteria Scheduling: Theory, Models and Algorithms. second ed. (2006), Springer, Berlin
187. Tseng C.T., and Liao C.J. A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks. International Journal of Production Research 46 17 (2008) 4655-4670
188. Tseng C.T., Liao C.J., and Liao T.X. A note on two-stage hybrid flowshop scheduling with missing operations. Computers and Industrial Engineering 54 3 (2008) 695-704
189. Tsubone H., Ohba M., Takamuki H., and Miyake Y. A production scheduling system for a hybrid flow-shop: a case-study. Omega-International Journal of Management Science 21 2 (1993) 205-214
190. Tsubone H., Ohba M., and Uetake T. The impact of lot sizing and sequencing on manufacturing performance in a two-stage hybrid flow shop. International Journal of Production Research 34 11 (1996) 3037-3053
191. Tsubone H., Suzuki M., Uetake T., and Ohba M. A comparison between basic cyclic scheduling and variable cyclic scheduling in a two-stage hybrid flow shop. Decision Sciences 31 1 (2000) 197-222
192. Uetake T., Tsubone H., and Ohba M. A production scheduling system in a hybrid flow shop. International Journal of Production Economics 41 1-3 (1995) 395-398
193. Vairaktarakis G., and Elhafsi M. The use of flowlines to simplify routing complexity in two-stage flowshops. IIE Transactions 32 8 (2000) 687-699
194. Vandevelde A., Hoogeveen H., Hurkens C., and Lenstra J.K. Lower bounds for the head-body-tail problem on parallel machines: a computational study of the multiprocessor flow shop. Informs Journal on Computing 17 3 (2005) 305-320
195. Verma S.K., and Dessouky M.I. Multistage hybrid flowshop scheduling with identical jobs and uniform parallel machines. Journal of Scheduling 2 (1999) 135-150
196. Vignier A., Billaut J.-C., and Proust C. Les problFmes d'ordonnancement de type flow-shop hybride: Ttat de l'art. RAIRO Recherche OpTrationnelle 33 2 (1999) 117-183
197. A. Vignier, J.-C. Billaut, C. Proust, V. T'Kindt, Resolution of some two-stage hybrid flowshop scheduling problems, in: IEEE International Conference on Systems, Man and Cybernetics, vol. 4, IEEE Press, 1996, pp. 2934-2941.
198. A. Vignier, P. Commandeur, C. Proust, New lower bound for the hybrid flowshop scheduling problem, in: Proceedings of the Sixth International Conference on Emerging Technologies and Factory Automation, ETFA '97, IEEE Press, 1997, pp. 446-451.
199. A. Vignier, D. Dardilhac, D. Dezalay, C. Proust, A branch and bound approach to minimize the total completion time in a k-stage hybrid flowshop, in: Proceedings of the Fifth International Conference on Emerging Technologies and Factory Automation, ETFA '96, IEEE Press, 1996, pp. 215-220.
200. S. Voss, The two-stage hybrid flow shop with sequence-dependent setup times, in: A. Jones, G. Fandel, T.R. Gulledge (Eds.), Operations Research in Production Planning and Control, Proceedings of a Joint German/US Conference, Springer-Verlag, 1993, pp. 215-220.
201. Voss S., and Witt A. Hybrid flow shop scheduling as a multi-mode multi-project scheduling problem with batching requirements: a real-world application. International Journal of Production Economics 105 2 (2007) 445-458
202. J.A. Vázquez Rodríguez, A. Salhi, Performance of single stage representation genetic algorithms in scheduling flexible flow shops, in: The 2005 IEEE Congress on Evolutionary Computation, vol. 2, IEEE Press, 2005, pp. 1364-1371.
203. Vázquez Rodríguez J.A., and Salhi A. A synergy exploiting evolutionary approach to complex scheduling problems. In: Bogle I.D.L., and Žilinskas J. (Eds). Computer Aided Methods in Optimal Design and Operations. Series on Computers and Operations Research (2006), World Scientific Publishing Co. Pvt. Ltd. 59-68
204. Vázquez Rodríguez J.A., and Salhi A. A robust meta-hyper-heuristic approach to hybrid flow shop scheduling. In: Dahal K.P., Tan K.C., and Cowling P.I. (Eds). Evolutionary Scheduling Studies in Computational Intelligence (2007), Springer-Verlag, Berlin Heidelberg 125-142 (Chapter 5)
205. Wang H. Flexible flow shop scheduling: optimum, heuristics and artificial intelligence solutions. Expert Systems 22 2 (2005) 78-85
206. Wang H., Jacob V., and Rolland E. Design of efficient hybrid neural networks for flexible flow shop scheduling. Expert Systems 20 4 (2003) 208-231
207. Wang X., and Tang L. A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers. Computers and Operations Research 36 3 (2009) 907-918
208. Wardono B., and Fathi Y. A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities. European Journal of Operational Research 155 2 (2004) 380-401
209. Wittrock R.J. Scheduling algorithms for flexible flow lines. IBM Journal of Research and Development 29 4 (1985) 401-412
210. Wittrock R.J. An adaptable scheduling algorithm for flexible flow lines. Operations Research 36 3 (1988) 445-453
211. Y. Wu, M. Liu, C. Wu, A genetic algorithm for solving flow shop scheduling problems with parallel machines and special procedure constraints, in: Proceedings of the Second International Conference on Machine Learning and Cybernetics, vol. 3, IEEE Press, 2003, pp. 1774-1779.
212. W. Xiao, P. Hao, S. Zhang, X. Xu, Hybrid flow shop scheduling using genetic algorithms, in: Proceedings of the Third World Congress on Intelligent Control and Automation, IEEE Press, 2000, pp. 537-541.
213. Xie J.X., and Wang X.J. Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints. Computers and Mathematics with Applications 50 10-12 (2005) 1629-1638
214. Xie J.X., Xing W.X., Liu Z.X., and Dong J.F. Minimum deviation algorithm for two-stage no-wait flowshops with parallel machines. Computers and Mathematics with Applications 47 12 (2004) 1857-1863
215. Xuan H., and Tang L. Scheduling a hybrid flowshop with batch production at the last stage. Computers and Operations Research 34 9 (2007) 2718-2733
216. Yang T., Kuo Y., and Chang I. Tabu-search simulation optimization approach for flow-shop scheduling with multiple processors - a case study. International Journal of Production Research 42 19 (2004) 4015-4030
217. Yang T., Kuo Y., and Cho C. A genetic algorithms simulation approach for the multi-attribute combinatorial dispatching decision problem. European Journal of Operational Research 176 3 (2007) 1859-1873
218. Y. Yang, Optimization and Heuristic Algorithms for Flexible Flow Shop Scheduling, Ph.D. Thesis, Columbia University, 1998.
219. Yanney J.D., and Kuo W. A practical approach to scheduling a multistage, multiprocessor flowshop problem. International Journal of Production Research 27 10 (1989) 1733-1742
220. Yaurima V., Burtseva L., and Tchernykh A. Hybrid flowshop with unrelated machines, sequence-dependent setup time, availability constraints and limited buffers. Computers and Industrial Engineering 56 4 (2009) 1452-1463
221. Ying K.C. An iterated greedy heuristic for multistage hybrid flowshop scheduling problems with multiprocessor tasks. Journal of the Operational Research Society 60 6 (2009) 810-817
222. Ying K.C., and Lin S.W. Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach. International Journal of Production Research 44 16 (2006) 3161-3177
223. Ying K.C., and Lin S.W. Scheduling multistage hybrid flowshops with multiprocessor tasks by an effective heuristic. International Journal of Production Research 47 13 (2009) 3525-3538
224. Zandieh M., Fatemi Ghomi S.M.T., and Moattar Husseini S.M. An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times. Applied Mathematics and Computation 180 1 (2006) 111-127
225. Zhang W., Yin C.Y., Liu J.Y., and Linn R.J. Multi-job lot streaming to minimize the mean completion time in m - 1 hybrid flowshops. International Journal of Production Economics 96 2 (2005) 189-200