Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective

Computers and Operations Research

Volumn 37, Issue 8, 2010, Pages 1439-1454

  Ribas, Imma ^a   Leisten, Rainer ^b   Framiñan, Jose M ^c  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b UNIVERSITY OF DUISBURG ESSEN   (Germany)

^c UNIVERSITY OF SEVILLE   (Spain)

Author keywords

Hybrid flow shop

Indexed keywords

HYBRID FLOW SHOP; HYBRID FLOW SHOP SCHEDULING; NEW APPROACHES; PRODUCTION SYSTEM; SCHEDULING PROBLEM; SOLUTION APPROACH; STATE OF THE ART; TWO CLASSIFICATION;

SCHEDULING;

MACHINE SHOP PRACTICE;

EID: 73449099561     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2009.11.001     Document Type: Review

References (164)

1. Johnson S.M. Optimal two-and three-stage production schedules with set up times included. Naval Research Logistics Quarterly 1 (1954) 61-68
2. Salvador M.S. A solution to a special class of flow shop scheduling problems. In: Elmaghraby S.E. (Ed). Symposium on the theory of scheduling and its applications (1973), Springer, Berlin 83-91
3. Garey M.R., and Johnson D.S. Computers and intractability: a guide to the theory of NP-completness (1979), Freeman, San Francisco
4. Vignier A., Billaut J.C., and Proust C. Hybrid flowshop scheduling problems: state of the art. Rairo-Recherche Operationnelle-Operations Research 33 2 (1999) 117-183
5. Linn R., and Zhang W. Hybrid flow shop scheduling: a survey. Computers & Industrial Engineering 37 1-2 (1999) 57-61
6. Kis T., and Pesch E. A review of exact solution methods for the non-preemptive multiprocessor flowshop problem. Eur J Oper Res 164 3 (2005) 592-608
7. Wang H. Flexible flow shop scheduling: optimum, heuristics and artificial intelligence solutions. Expert Syst 22 2 (2005) 78-85
8. Quadt D., and Kuhn H. A taxonomy of flexible flow line scheduling procedures. Eur J Oper Res 178 3 (2007) 686-698
9. Graham R.L., Lawler E.L., Lenstra J.K., and Rinnooy Kan A.H.G. Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5 (1979) 287-326
10. 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. Ann Oper Res 69 (1997) 171-191
11. 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. Int J Prod Econ 96 2 (2005) 189-200
12. Li S.L. A hybrid two-stage flowshop with part family, batch production, major and minor set-ups. Eur J Oper Res 102 1 (1997) 142-156
13. Gupta J.N.D., and Tunc E.A. Minimizing tardy jobs in a two-stage hybrid flowshop. Int J Prod Res 36 9 (1998) 2397-2417
14. Gupta J.N.D., Sexton R.S., and Tunc E.A. Selecting scheduling heuristics using neural networks. Informs J Comput 12 2 (2000) 150-162
15. Lee G.C., and Kim Y.D. A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness. Int J Prod Res 42 22 (2004) 4731-4743
16. Guinet A., Solomon M.M., Kedia P.K., and Dussauchoy A. A computational study of heuristics for two-stage flexible flowshops. Int J Prod Res 34 5 (1996) 1399-1415
17. 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 Int J Manag Sci 25 5 (1997) 547-555
18. Haouari M., Hidri L., and Gharbi A. Optimal scheduling of a two-stage hybrid flow shop. Math Methods Oper Res 64 1 (2006) 107-124
19. Hong T.P., and Wang T.T. Fuzzy flexible flow shops at two machine centers for continuous fuzzy domains. Inf Sci 129 1-4 (2000) 227-237
20. Kouvelis P., and Vairaktarakis G. Flowshops with processing flexibility across production stages. IIE Trans 30 8 (1998) 735-746
21. Soewandi H., and Elmaghraby S. Sequencing three-stage flexible flowshops with identical machines to minimize makespan. IIE Trans 33 11 (2001) 985-994
22. Jin Z.H., Ohno K., Ito T., and Elmaghraby S.E. Scheduling hybrid flowshops in printed circuit board assembly lines. Prod Oper Manag 11 2 (2002) 216-230
23. Tang L.X., Luh P.B., Liu J.Y., and Fang L. Steel-making process scheduling using Lagrangian relaxation. Int J Prod Res 40 1 (2002) 55-70
24. Babayan A., and He D. Solving the n-job 3-stage flexible flowshop scheduling problem using an agent-based approach. Int J Prod Res 42 4 (2004) 777-799
25. Santos D.L., Hunsucker J.L., and Deal D.E. Global lower bounds for flow shops with multiple processors. Eur J Oper Res 80 1 (1995) 112-120
26. Santos D.L., Hunsucker J.L., and Deal D.E. An evaluation of sequencing heuristics in flow shops with multiple processors. Comput Ind Eng 30 4 (1996) 681-691
27. Guinet A.G.P., and Solomon M.M. Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time. Int J Prod Res 34 6 (1996) 1643-1654
28. Brah S.A. A comparative analysis of due date based job sequencing rules in a flow shop with multiple processors. Prod Plann Control 7 4 (1996) 362-373
29. Nowicki E., and Smutnicki C. The flow shop with parallel machines: a tabu search approach. Eur J Oper Res 106 2-3 (1998) 226-253
30. Portmann M.C., Vignier A., Dardilhac D., and Dezalay D. Branch and bound crossed with GA to solve hybrid flowshops. Eur J Oper Res 107 2 (1998) 389-400
31. 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
32. Brockmann K, Dangelmaier W, Holthöfer N. Parallel branch & bound algorithm for makespan optimal scheduling in flow shops with multiple processor. SOR'97, 1997.
33. Brockmann K, Dangelmaier W. A parallel branch & bound algorithm for makespan optimal sequencing in flow shops with parallel machines. In: Borne P, Ksouri M, El Kamel A, editors. Proceding of the IMACS multiconference on computational engineering systems applications (CESA 1998), vol. 3. 1998. p. 341-436.
34. Havill JT, Mao W. On-line algorithms for hybrid flow shop scheduling. In: Proceedings for the fourth international conference on computer science and informatics, 1998. p. 134-7.
35. Brah S.A., and Loo L.L. Heuristics for scheduling in a flow shop with multiple processors. Eur J Oper Res 113 1 (1999) 113-122
36. Carlier J., and Neron E. An exact method for solving the multi-processor flow-shop. Rairo Rech Operationnelle Oper Res 34 1 (2000) 1-25
37. Moursli O., and Pochet Y. A branch-and-bound algorithm for the hybrid flowshop. Int J Prod Econ 64 1-3 (2000) 113-125
38. Botta-Genoulaz V. Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness. Int J Prod Econ 64 1-3 (2000) 101-111
39. Liu C.Y., and Chang S.C. Scheduling flexible flow shops with sequence-dependent setup effects. IEEE Trans Robotics Automation 16 (2000) 408-419
40. Santos D.L., Hunsucker J.L., and Deal D.E. On makespan improvement in flow shops with multiple processors. Prod Plann Control 12 3 (2001) 283-295
41. Negenman E.G. Local search algorithms for the multiprocessor flow shop scheduling problem. Eur J Oper Res 128 1 (2001) 147-158
42. Neron E., Baptiste P., and Gupta J.N.D. Solving hybrid flow shop problem using energetic reasoning and global operations. Omega Int J Manage Sci 29 6 (2001) 501-511
43. Azizoglu M., Cakmak E., and Kondakci S. A flexible flowshop problem with total flow time minimization. Eur J Oper Res 132 3 (2001) 528-538
44. Kyparisis G.J., and Koulamas C. A note on weighted completion time minimization in a flexible flow shop. Oper Res Lett 29 1 (2001) 5-11
45. Cheng J., Yoshiyuki K., and Kise H. A shifting bottleneck approach for parallel-machine flowshop scheduling problem. J Oper Res Soc Jpn 44 2 (2001) 141-154
46. Djellab H., and Djellab K. Preemptive hybrid flowshop scheduling problem of interval orders. Eur J Oper Res 137 1 (2002) 37-49
47. Wang H., Jacob V., and Rolland E. Design of efficient hybrid neural networks for flexible flow shop scheduling. Expert Syst 20 4 (2003) 208-231
48. Engin O., and Doyen A. A new approach to solve hybrid flow shop scheduling problems by artificial immune system. Future Generation Comput Syst 20 6 (2004) 1083-1095
49. Lee G.C., Kim Y.D., and Choi S.W. Bottleneck-focused scheduling for a hybrid flowshop. Int J Prod Res 42 1 (2004) 165-181
50. Quadt D. Lot-sizing and scheduling for flexible flow lines (2004), Springer, Berlin, Heidelberg
51. Acero-Dominguez M, Paternina-Arboleda C. In: Jones MH, Patek SD, Tawney BE, editors. Scheduling jobs on a k-stage flexible flow shop using a TOC-based (bottleneck) procedure. 2004.
52. Choi S.W., Kim Y.D., and Lee G.C. Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop. Int J Prod Res 43 11 (2005) 2149-2167
53. Quadt D., and Kuhn H. Conceptual framework for lot-sizing and scheduling of flexible flow lines. Int J Prod Res 43 11 (2005) 2291-2308
54. Morita H., and Shio N. Hybrid branch and bound method with genetic algorithm for flexible flowshop scheduling problem. Jsme Int J Ser C Mech Syst Mach Elem Manuf 48 1 (2005) 46-52
55. 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 J Comput 17 3 (2005) 305-320
56. Takaku K., and Yura K. Online scheduling aiming to satisfy due date for flexible flow shops. Jsme Int J Ser C Mech Syst Mach Elem Manuf 48 1 (2005) 21-25
57. Jin Z.H., Yang Z., and Ito T. Metaheuristic algorithms for the multistage hybrid flowshop scheduling problem. Int J Prod Econ 100 2 (2006) 322-334
58. Allahverdi A., and Al-Anzi F.S. Scheduling multi-stage parallel-processor services to minimize average response time. J Oper Res Soc 57 (2006) 101
59. Tang L.X., Xuan H., and Liu J.Y. A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time. Comput Oper Res 33 11 (2006) 3344-3359
60. Torabi S.A., Ghomi S.M.T.F., and Karimi B. A hybrid genetic algorithm for the finite horizon economic lot and delivery scheduling in supply chains. Eur J Oper Res 173 1 (2006) 173-189
61. 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. Appl Math Comput 180 1 (2006) 111-127
62. Belkadi K., Gourgand M., and Benyettou M. Parallel genetic algorithms with migration for the hybrid flow shop scheduling problem. J Appl Math Decis Sci (2006) 1-17
63. Belkadi K., Gourgand M., Benyettou M., and Aribi A. Sequential and parallel genetic algorithm for the hybrid flow shop scheduling problem. J Appl Sci 6 4 (2006) 775-778
64. Janiak A., Kozan E., Lichtenstein M., and Oguz C. Metaheuristic approaches to the hybrid flow shop scheduling problem with a cost-related criterion. Int J Prod Econ 105 2 (2007) 407-424
65. Quadt D., and Kuhn H. Batch scheduling of jobs with identical process times on flexible flow lines. Int J Prod Econ 105 2 (2007) 385-401
66. Paternina-Arboleda C, Montoya-Torres J, Acero-Dominguez M, Herrera-Hernandez M. Scheduling jobs on a k -stage flexible flow-shop. Ann Oper Res 2007;164(1):29-40.
67. Xuan H., and Tang L.X. Scheduling a hybrid flowshop with batch production at the last stage. Comput Oper Res 34 9 (2007) 2718-2733
68. Alaykyran K., Engin O., and Doyen A. Using ant colony optimization to solve hybrid flow shop scheduling problems. Int J Adv Manuf Technol 35 5-6 (2007) 541-550
69. Shiau D.F., Cheng S.C., and Huang Y.M. Proportionate flexible flow shop scheduling via a hybrid constructive genetic algorithm. Expert Syst Appl 34 2 (2008) 1133-1143
70. Gupta J.N.D., Krüger K., Lauff V., Werner F., and Sotskov Y.N. Heuristics for hybrid flow shops with controllable processing times and assignable due dates. Comput Oper Res 29 10 (2002) 1417-1439
71. Yang T., Kuo Y., and Chang I. Tabu-search simulation optimization approach for flow-shop scheduling with multiple processors-a case study. Int J Prod Res 42 19 (2004) 4015-4030
72. 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. J Intell Manuf 16 3 (2005) 361-370
73. Yang T., Kuo Y., and Cho C. A genetic algorithms simulation approach for the multi-attribute combinatorial dispatching decision problem. Eur J Oper Res 176 3 (2007) 1859-1873
74. Allaoui H., and Artiba A. Scheduling two-stage hybrid flow shop with availability constraints. Comput Oper Res 33 5 (2006) 1399-1419
75. Xie J.X., and Wang X.J. Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints. Comput Math Appl 50 10-12 (2005) 1629-1638
76. Alisantoso D., Khoo L.P., and Jiang P.Y. An immune algorithm approach to the scheduling of a flexible PCB flow shop. Int J Adv Manuf Technol 22 11-12 (2003) 819-827
77. Allaoui H., and Artiba A. Integrating simulation and optimization to schedule a hybrid flow shop with maintenance constraints. Comput Ind Eng 47 4 (2004) 431-450
78. 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. Eur J Oper Res 181 1 (2007) 40-58
79. Sawik T. Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers. Math Comput Model 31 13 (2000) 39-52
80. Akrami B., Karimi B., and Hosseini S.M.M. Two metaheuristic methods for the common cycle economic lot sizing and scheduling in flexible flow shops with limited intermediate buffers: the finite horizon case. Appl Math Comput 183 1 (2006) 634-645
81. Akkerman R., van Donk D.P., and Gaalman G. Influence of capacity- and time-constrained intermediate storage in two-stage food production systems. Int J Prod Res 45 13 (2007) 2955-2973
82. Sawik T.J. Scheduling flexible flow lines with no in-process buffers. Int J Prod Res 33 5 (1995) 1357-1367
83. Thornton H.W., and Hunsucker J.L. A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage. Eur J Oper Res 152 (2004) 96-114
84. Tavakkoli-Moghaddam R., Safaei N., and Sassani F. A memetic algorithm for the flexible flow line scheduling problem with processor blocking. Comput Oper Res 36 2 (2009) 402-414
85. Sawik T. A lexicographic approach to bi-objective scheduling of single-period orders in make-to-order manufacturing. Eur J Oper Res 180 3 (2007) 1060-1075
86. Chang J, Yan W, Shao H. Scheduling a two-stage nowait hybrid flowshop with separated setup and removal times. In: Proceedings of the American control conference Boston, MA, United States, June 30-July 2, vol. 2. 2004. p. 1412-6.
87. Wang Z.B., Xing W.X., and Bai F.S. No-wait flexible flowshop scheduling with no-idle machines. Oper Res Lett 33 6 (2005) 609-614
88. Garcia J.M., and Lozano S. Production and delivery scheduling problem with time windows. Comput Ind Eng 48 (2005) 733-742
89. Guirchoun S., Martineau P., and Billaut J. Total completion time minimization in a computer system with a server and two parallel processors. Comput Oper Res 32 3 (2005) 599-611
90. Oguz C., and Ercan M.F. Scheduling multiprocessor tasks in a two-stage flow-shop environment. Comput Ind Eng 33 1-2 (1997) 269-272
91. 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. Eur J Oper Res 149 2 (2003) 390-403
92. Oguz C, Fung YF, Ercan MF, Qi XT. Parallel genetic algorithm for a flow-shop problem with multiprocessor Task. ICCSA 2003, Lecture notes in computer sciences, vol. 2667. 2003. p. 987-97.
93. Oguz C., Zinder Y., Do V., Janiak A., and Lichtenstein M. Hybrid flow-shop scheduling problems with multiprocessor task systems. Eur J Oper Res 152 1 (2004) 115-131
94. Serifoglu F.S., and Ulusoy G. Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach. J Oper Res Soc 55 5 (2004) 504-512
95. Oguz C., and Ercan M. A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks. J Scheduling 8 4 (2005) 323-351
96. Ying K.C., and Lin S.W. Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach. Int J Prod Res 44 16 (2006) 3161-3177
97. Ying K.C. An iterated greedy heuristic for multistage hybrid flowshop scheduling problems with multiprocessor tasks. J Oper Res Soc 60 (2009) 810-817
98. Brucker P., and Krämer A. Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems. Eur J Oper Res 90 2 (1996) 214-226
99. Huang W., and Li S. A two-stage hybrid flowshop with uniform machines and setup times. Math Comput Model 27 2 (1998) 27-45
100. Dessouky M.M., Dessouky M.I., and Verma S.K. Flowshop scheduling with identical jobs and uniform parallel machines. Eur J Oper Res 109 3 (1998) 620-631
101. Soewandi H., and Elmaghraby S.E. Sequencing on two-stage hybrid flowshops with uniform machines to minimize makespan. IIE Trans 35 5 (2003) 467-477
102. Kyparisis G.J., and Koulamas C. A note on makespan minimization in two-stage flexible flow shops with uniform machines. Eur J Oper Res 175 2 (2006) 1321-1327
103. Bertel S., and Billaut J.-. A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation. Eur J Oper Res 159 3 (2004) 651-662
104. Sevastianov S.V. Geometrical heuristics for multiprocessor flowshop scheduling with uniform machines at each stage. J Scheduling 5 3 (2002) 205-225
105. Kyparisis G.J., and Koulamas C. Flexible flow shop scheduling with uniform parallel machines. Eur J Oper Res 168 3 (2006) 985-997
106. Verma S.K., and Dessouky M.M. Multistage hybrid flowshop scheduling with identical jobs and uniform parallel machines. J Scheduling 2 (1999) 135-150
107. Voss S., and Witt A. Hybrid flow shop scheduling as a multi-mode multi-project scheduling problem with batching requirements: a real-world application. Int J Prod Econ 105 2 (2007) 445-458
108. Kadipasaoglu S.N., Xiang W., and Khumawala B.M. A note on scheduling hybrid flow systems. Int J Prod Res 35 5 (1997) 1491-1494
109. Kadipasaoglu S.N., Xiang W., and Khumawala B.M. A comparison of sequencing rules in static and dynamic hybrid flow systems. Int J Prod Res 35 5 (1997) 1359-1384
110. Suresh V. A note on scheduling of two-stage flow shop with multiple processors. Int J Prod Econ 49 1 (1997) 77-82
111. Jungwattanakit J, Reodecha M, Chaovalitwongse P, Werner F. An evaluation of sequencing heuristics for flexible flowshop scheduling problems with unrelated parallel machines and dual criteria. Otto-von-Guericke-Universitat Magdeburg, Preprint, 2005. p. 1-23.
112. Hayrinen T., Johnsson M., Johtela T., Smed J., and Nevalainen O. Scheduling algorithms for computer-aided line balancing in printed circuit board assembly. Prod Plann Control 11 5 (2000) 497-510
113. Low C. Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines. Comput Oper Res 32 (2005) 2013-2025
114. Jenabi M., Ghomi S.M.T.F., Torabi S.A., and Karimi B. Two hybrid meta-heuristics for the finite horizon ELSP in flexible flow lines with unrelated parallel machines. Appl Math Comput 186 1 (2007) 230-245
115. Sawik T. Integer programming approach to production scheduling for make-to-order manufacturing. Math Comput Model 41 1 (2005) 99-118
116. Sawik T. Hierarchical approach to production scheduling in make-to-order assembly. Int J Prod Res 44 4 (2006) 801-830
117. 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. Comput Oper Res 35 3 (2008) 845-853
118. He L.M., Sun S.J., and Luo R.Z. A hybrid two-stage flowshop scheduling problem. Asia Pac J Oper Res 24 1 (2007) 45-56
119. Oguz C., Lin B.M.T., and Cheng T.C.E. Two-stage flowshop scheduling with a common second-stage machine. Comput Oper Res 24 12 (1997) 1169-1174
120. Riane F., Artiba A., and Elmaghraby S.E. Sequencing a hybrid two-stage flowshop with dedicated machines. Int J Prod Res 40 17 (2002) 4353-4380
121. Uetake T., Tsubone H., and Ohba M. A production scheduling system in a hybrid flow shop. Int J Prod Econ 41 1-3 (1995) 395-398
122. Tsubone H., Ohba M., and Uetake T. The impact of lot sizing and sequencing on manufacturing performance in a two-stage hybrid flow shop. Int J Prod Res 34 11 (1996) 3037-3053
123. 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. Decis Sci 31 1 (2000) 197-222
124. Riane F., Artiba A., and Elmaghraby S.E. A hybrid three-stage flowshop problem: efficient heuristics to minimize makespan. Eur J Oper Res 109 2 (1998) 321-329
125. Lin H.T., and Liao C.J. A case study in a two-stage hybrid flow shop with setup time and dedicated machines. Int J Prod Econ 86 2 (2003) 133-143
126. Ruiz R., and Maroto C. A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility. Eur J Oper Res 169 3 (2006) 781-800
127. Ruiz R., Serifoglu F.S., and Urlings T. Modeling realistic hybrid flexible flowshop scheduling problems. Comput Oper Res 35 4 (2008) 1151-1175
128. Allahverdi A., Ng C.T., Cheng T.C.E., and Kovalyov M.Y. A survey of scheduling problems with setup times or costs. Eur J Oper Res 187 3 (2008) 985-1032
129. Kurz M.E., and Askin R.G. Comparing scheduling rules for flexible flow lines. Int J Prod Econ 85 3 (2003) 371-388
130. Kurz M.E., and Askin R.G. Scheduling flexible flow lines with sequence-dependent setup times. Eur J Oper Res 159 1 (2004) 66-82
131. Logendran R., Carson S., and Hanson E. Group scheduling in flexible flow shops. Int J Prod Econ 96 2 (2005) 143-155
132. Logendran R., deSzoeke P., and Barnard F. Sequence-dependent group scheduling problems in flexible flow shops. Int J Prod Econ 102 1 (2006) 66-86
133. Tang L.X., and Zhang Y.Y. Heuristic combined artificial neural networks to schedule hybrid flow shop with sequence dependent setup times. Adv Neural Netw-Isnn 2005, Pt 1, Proceedings 3496 (2005) 788-793
134. Jungwattanakit J., Reodecha M., Chaovalitwongse P., and Werner F. Algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria. Int J Adv Manuf Technol 37 3-4 (2008) 354-370
135. Leon V.J., and Ramamoorthy B. An adaptable problem-space-based search method for flexible flow line scheduling. IIE Trans 29 2 (1997) 115-125
136. Kurz M.E., and Askin R.G. An adaptable problem-space-based search method for flexible flow line scheduling. IIE Trans 33 8 (2001) 691-693
137. Tseng C.T., Liao C.J., and Liao T.X. A note on two-stage hybrid flowshop scheduling with missing operations. Comput Ind Eng 54 3 (2008) 695-704
138. T'kindt V., and Billaut J.C. Multicriteria scheduling: çtheory, models and algorithms (2002), Springer, Berlin
139. Gupta J.N.D. Two-stage, hybrid flow shop scheduling problem. J Oper Res Soc 39 4 (1988) 359-364
140. Hoogeveen J.A., Lenstra J.K., and Veltman B. Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard. Eur J Oper Res 89 1 (1996) 172-175
141. Sawik T., Schaller A., and Tirpak T.M. Scheduling of printed wiring board assembly in surface mount technology lines. J Electron Manuf 11 1 (2002) 1-17
142. Sawik T. An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers. Math Comput Model 36 4-5 (2002) 461-471
143. Chen B. Analysis of classes of heuristics for scheduling a 2-stage flow-shop with parallel machines at one-stage. J Oper Res Soc 46 2 (1995) 234-244
144. Nawaz M., Enscore Jr. E.E., and Ham I. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11 1 (1983) 91-95
145. Campbell H.G., Dudek R.A., and Smith M.L. An heuristic algorithm for the n job m machine sequencing problem. Manage Sci 16 (1970) 630-637
146. Dannenbring D.G. An evaluation of flow shop sequencing heuristics. Manage Sci 23 1 (1977) 1174-1182
147. Gupta J.N.D. A functional heuristic algorithm for the flow shop scheduling problem. Oper Res Q 22 1 (1971) 39-47
148. Palmer D.S. Sequencing jobs through a multi-stage process in the minimum total time-a quick method of obtaining a near optimum. Oper Res Q 16 (1965) 101-107
149. Ho J.C. Flowshop sequencing with mean flowtime objective. Euro J Oper Res 81 3 (1995) 571-578
150. Koulamas C., and Kyparisis G.J. Asymptotically optimal linear time algorithms for two-stage and three-stage flexible flow shops. Nav Res Logistics 47 3 (2000) 259-268
151. Sriskandarajah C., and Sethi S.P. Scheduling algorithms for flexible flowshops: worst and average case performance. Eur J Oper Res 43 2 (1989) 143-160
152. Yang T., and Ignizio J.P. An algorithm for the scheduling of army battalion training exercises. Comput Oper Res 14 6 (1987) 479-491
153. Dauzère-Pérès S. A connected neighborhood structure for the multiprocessor job-shop scheduling problem. Rotterdam: Erasmus University Rotterdam, Rotterdam School of Management; 1994.
154. Hurink J., Jurisch B., and Thole M. Tabu search for the job-shop scheduling problem with multi-purpose machines. OR Spectr 15 4 (1994) 205-215
155. Nowicki E., and Smutnicki C. A fast taboo search algorithm for the job shop problem. Manage Sci 42 6 (1996) 797-813
156. Nowicki E., and Smutnicki C. A fast tabu search algorithm for the permutation flow-shop problem. Eur J Oper Res 91 1 (1996) 160-175
157. Haouari M., and M'Hallah R. Heuristic algorithms for the two-stage hybrid flowshop problem. Oper Res Lett 21 1 (1997) 43-53
158. Wardono B., and Fathi Y. A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities. Eur J Oper Res 155 2 (2004) 380-401
159. Tang L., and Xuan H. Lagrangian relaxation algorithms for real-time hybrid flowshop scheduling with finite intermediate buffers. J Oper Res Soc 57 3 (2006) 316-324
160. Wang X, Tang L. A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers. Comput Oper Res 2009;36(3):907-18.
161. Narashimhan S.L., and Mangiameli P.M. A comparison of sequencing rules for a two stage hybrid flow shop. Decis Sci 18 2 (1987) 250-265
162. Grangeon N., Tanguy A., and Tchernev N. Generic simulation model for hybrid flow-shop. Comput Ind Eng 37 1-2 (1999) 207-210
163. Riane F., Artiba A., and Iassinovski S. An integrated production planning and scheduling system for hybrid flowshop organizations. Int J Prod Econ 74 1-3 (2001) 33-48
164. Wong W.K., Chan C.K., and Ip W.H. A hybrid flowshop scheduling model for apparel manufacture. Int J Clothing Sci Technol 13 2 (2001) 115-131