×

The hybrid flow shop scheduling problem. (English) Zbl 1188.90110

Summary: The scheduling of flow shops with multiple parallel machines per stage, usually referred to as the hybrid flow shop (HFS), is a complex combinatorial problem encountered in many real world applications. Given its importance and complexity, the HFS problem has been intensively studied. This paper presents a literature review on exact, heuristic and metaheuristic methods that have been proposed for its solution. The paper briefly discusses and reviews several variants of the HFS problem, each in turn considering different assumptions, constraints and objective functions. Research opportunities in HFS are also discussed.

MSC:

90B35 Deterministic scheduling theory in operations research

Keywords:

review

Software:

BPSS
Full Text: DOI

References:

[1] M.J. Acero-Domfnguez, C.D. Patermina-Arboleda, Scheduling jobs on a \(k\); M.J. Acero-Domfnguez, C.D. Patermina-Arboleda, Scheduling jobs on a \(k\)
[2] Adler, L.; Fraiman, N.; Kobacker, E.; Pinedo, M.; Plotnicoff, J. C.; Wu, T. P., Bpss: a scheduling support system for the packaging industry, Operations Research, 41, 4, 641-648 (1993)
[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.; 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.; 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, 4323-4339 (2002) · Zbl 1064.90515
[5] Agnetis, A.; Pacifici, A.; Rossi, F.; Lucertini, M.; Nicoletti, S.; Nicolo, F.; Oriolo, G.; Pacciarelli, D.; Pesaro, E., Scheduling of flexible flow lines in an automobile assembly plant, European Journal of Operational Research, 97, 2, 348-362 (1997) · Zbl 0930.90016
[6] Alaykyran, K.; Engin, O.; Doyen, A., Using ant colony optimization to solve hybrid flow shop scheduling problems, International Journal of Advanced Manufacturing Technology, 35, 5-6, 541-550 (2007)
[7] Alfieri, A., Workload simulation and optimisation in multi-criteria hybrid flowshop scheduling: a case study, International Journal of Production Research, 47, 18, 5129-5145 (2009) · Zbl 1198.90163
[8] Allahverdi, A.; Al-Anzi, F. S., Scheduling multi-stage parallel-processor services to minimize average response time, Journal of the Operational Research Society, 57, 1, 101-110 (2006) · Zbl 1121.90050
[9] Allahverdi, A.; Ng, C. T.; Cheng, T. C.E.; Kovalyov, M. Y., A survey of scheduling problems with setup times or costs, European Journal of Operational Research, 187, 3, 985-1032 (2008) · Zbl 1137.90474
[10] Allahverdi, H. M.; Soroush, A., The significance of reducing setup times/setup costs, European Journal of Operational Research, 187, 3, 978-984 (2008) · Zbl 1137.90475
[11] Allaoui, H.; Artiba, A., Integrating simulation and optimization to schedule a hybrid flow shop with maintenance constraints, Computers and Industrial Engineering, 47, 4, 431-450 (2004)
[12] Allaoui, H.; Artiba, A., Scheduling two-stage hybrid flow shop with availability constraints, Computers and Operations Research, 33, 5, 1399-1419 (2006) · Zbl 1126.90017
[13] Andres, C.; Albarracin, J. M.; Tormo, G.; Vicens, E.; Garcia-Sabater, J. P., Group technology in a hybrid flowshop environment: a case study, European Journal of Operational Research, 167, 1, 272-281 (2005) · Zbl 1074.90524
[14] Arthanary, T. S.; Ramaswamy, K. G., An extension of two machine sequencing problem, OPSEARCH: The Journal of the Operational Research Society of India, 8, 4, 10-22 (1971)
[15] Azizoglu, M.; Cakmak, E.; Kondakci, S., A flexible flowshop problem with total flow time minimization, European Journal of Operational Research, 132, 3, 528-538 (2001) · Zbl 1024.90037
[16] Babayan, A.; He, D., Solving the \(n\)-job three-stage flexible flowshop scheduling problem using an agent-based approach, International Journal of Production Research, 42, 4, 777-799 (2004) · Zbl 1069.90038
[17] Bellanger, A.; Oulamara, A., Scheduling hybrid flowshop term with parallel batching machines and compatibilities, Computers and Operations Research, 36, 6, 1982-1992 (2009) · Zbl 1179.90125
[18] Bertel, S.; Billaut, J.-C., A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation, European Journal of Operational Research, 159, 3, 651-662 (2004) · Zbl 1065.90032
[19] Bolat, A.; Al-Harkan, I.; Al-Harbi, B., Flow-shop scheduling for three serial stations with the last two duplicate, Computers and Operations Research, 32, 3, 647-667 (2005) · Zbl 1061.90044
[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.; 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, 101-111 (2000)
[22] S.A. Brah, Scheduling in a Flow Shop with Multiple Processors, Thesis/Dissertation, University of Houston, 1988.; 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, 362-373 (1996)
[24] Brah, S. A.; Hunsucker, J. L., Branch and bound algorithm for the flow-shop with multiple processors, European Journal of Operational Research, 51, 1, 88-99 (1991) · Zbl 0732.90040
[25] Brah, S. A.; Loo, L. L., Heuristics for scheduling in a flow shop with multiple processors, European Journal of Operational Research, 113, 1, 113-122 (1999) · Zbl 0933.90026
[26] Brah, S. A.; Wheeler, G. E., Comparison of scheduling rules in a flow shop with multiple processors: a simulation, Simulation, 71, 5, 302-311 (1998) · Zbl 1065.68654
[27] Bratley, P.; Florian, M.; Robillard, P., Scheduling with earliest start and due date constraints on multiple machines, Naval Research Logistics Quearterly, 22, 1, 165-173 (1975) · Zbl 0306.90032
[28] Caricato, P.; Grieco, A.; Serino, D., TSP-based scheduling in a batch-wise hybrid flow-shop, Robotics and Computer-Integrated Manufacturing, 23, 2, 234-241 (2007)
[29] Carlier, J.; NTron, E., An exact method for solving the multi-processor flow-shop, RAIRO Recherche OpTrationnelle, 34, 1, 1-25 (2000) · Zbl 0963.90027
[30] Chang, S.-C.; Liao, D.-Y., Scheduling flexible flow shops with no setup effects, IEEE Transactions on Robotics and Automation, 10, 2, 112-122 (1994)
[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, 234-244 (1995) · Zbl 0827.90070
[32] Chen, C. L.; 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, 6415-6430 (2008) · Zbl 1154.90358
[33] Chen, C. L.; 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, 1393-1401 (2009)
[34] Chen, C. L.; Usher, J. M.; 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, 157-168 (1998)
[35] Chen, L.; Bostel, N.; Dejax, P.; Cai, J. C.; 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, 40-58 (2007) · Zbl 1121.90054
[36] Chen, L.; Xi, L.-F.; Cai, J.-G.; Bostel, N.; Dejax, P., An integrated approach for modeling and solving the scheduling problem of container handling systems, Journal of Zhejiang University Science A, 7, 2, 234-239 (2006) · Zbl 1163.90483
[37] Cheng, J. L.; Karuno, Y.; Kise, H., A shifting bottleneck approach for a parallel-machine flowshop scheduling problem, Journal of the Operations Research Society of Japan, 44, 2, 140-156 (2001) · Zbl 1038.90032
[38] Choi, H. S.; Lee, D. H., Scheduling algorithms to minimize the number of tardy jobs in two-stage hybrid flow shops, Computers and Industrial Engineering, 56, 1, 113-120 (2009)
[39] Choi, S.-W.; Kim, Y.-D.; Lee, G.-C., Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop, International Journal of Production Research, 43, 11, 2149-2167 (2005) · Zbl 1068.90056
[40] Deal, D. E.; Yang, T.; Hallquist, S., Job scheduling in petrochemical production: two-stage processing with finite intermediate storage, Computers and Chemical Engineering, 18, 4, 333-344 (1994)
[41] Dessouky, M. M.; Dessouky, M. I.; Verma, S. K., Flowshop scheduling with identical jobs and uniform parallel machines, European Journal of Operational Research, 109, 3, 620-631 (1998) · Zbl 0936.90022
[42] Ding, F. Y.; Kittichartphayak, D., Heuristics for scheduling flexible flow lines, Computers and Industrial Engineering, 26, 1, 27-34 (1994)
[43] Djellab, H.; Djellab, K., Preemptive hybrid flowshop scheduling problem of interval orders, European Journal of Operational Research, 137, 1, 37-49 (2002) · Zbl 1002.90026
[44] Dror, M.; Mullaserif, P. A., Three stage generalized flowshop: scheduling civil engineering projects, Journal of Global Optimization, 9, 3-4, 321-344 (1996) · Zbl 0866.90071
[45] Engin, O.; Doyen, A., A new approach to solve hybrid flow shop scheduling problems by artificial immune system, Future Generation Computer Systems, 20, 6, 1083-1095 (2004)
[46] Figielska, E., A new heuristic for scheduling the two-stage flowshop with additional resources, Computers and Industrial Engineering, 54, 4, 750-763 (2008)
[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, 142-151 (2009)
[48] Finke, D. A.; Medeiros, D. J.; Traband, M. T., Multiple machine jit scheduling: a tabu search approach, International Journal of Production Research, 45, 21, 4899-4915 (2007) · Zbl 1126.90327
[49] Garey, M. R.; Johnson, D. S., Computers and intractability: a guide to the theory of NP-completeness. Computers and intractability: a guide to the theory of NP-completeness, A Series of Books in the Mathematical Sciences (1979), W.H. Freeman: W.H. Freeman San Francisco · Zbl 0411.68039
[50] Gooding, W. B.; Pekny, J. F.; Mccroskey, P. S., Enumerative approaches to parallel flowshop scheduling via problem transformation, Computers and Chemical Engineering, 18, 10, 909-927 (1994)
[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.; 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. · Zbl 1190.90087
[52] Grabowski, J.; Pempera, J., Sequencing of jobs in some production system, European Journal of Operational Research, 125, 3, 535-550 (2000) · Zbl 0967.90045
[53] Grangeon, N.; Tanguy, A.; Tchernev, N., Generic simulation model for hybrid flow-shop, Computers and Industrial Engineering, 37, 1-2, 207-210 (1999)
[54] Gue, K. R.; Nemhauser, G. L.; Padron, M., Production scheduling in almost continuous time, IIE Transactions, 29, 5, 391-398 (1997)
[55] Guinet, A. G.P.; Solomon, M. M., Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time, International Journal of Production Research, 34, 6, 1643-1654 (1996) · Zbl 0927.90033
[56] Guinet, A. G.P.; Solomon, M. M.; Kedia, P. K.; Dussauchoy, A., A computational study of heuristics for two-stage flexible flowshops, International Journal of Production Research, 34, 5, 1399-1415 (1996) · Zbl 0947.90540
[57] Guirchoun, S.; Martineau, P.; Billaut, J.-C., Total completion time minimization in a computer system with a server and two parallel processors, Computers and Operations Research, 32, 3, 599-611 (2005) · Zbl 1077.90024
[58] Gupta, J. N.D., Two-stage, hybrid flow shop scheduling problem, Journal of the Operational Research Society, 39, 4, 359-364 (1988) · Zbl 0639.90049
[59] Gupta, J. N.D.; Hariri, A. M.A.; Potts, C. N., Scheduling a two-stage hybrid flow shop with parallel machines at the first stage, Annals of Operations Research, 69, 171-191 (1997) · Zbl 0880.90071
[60] Gupta, J. N.D.; Kruger, K.; Lauff, V.; Werner, F.; Sotskov, Y. N., Heuristics for hybrid flow shops with controllable processing times and assignable due dates, Computers and Operations Research, 29, 10, 1417-1439 (2002) · Zbl 0994.90114
[61] Gupta, J. N.D.; Sexton, R. S.; Tunc, E. A., Selecting scheduling heuristics using neural networks, Informs Journal on Computing, 12, 2, 150-162 (2000) · Zbl 1034.90002
[62] Gupta, J. N.D.; Tunc, E. A., Schedules for a two-stage hybrid flowshop with parallel machines at the second stage, International Journal of Production Research, 29, 7, 1489-1502 (1991)
[63] Gupta, J. N.D.; Tunc, E. A., Scheduling a two-stage hybrid flowshop with separable setup and removal times, European Journal of Operational Research, 77, 3, 415-428 (1994) · Zbl 0809.90080
[64] Gupta, J. N.D.; Tunc, E. A., Minimizing tardy jobs in a two-stage hybrid flowshop, International Journal of Production Research, 36, 9, 2397-2417 (1998) · Zbl 0945.90567
[65] Haouari, M.; Hidri, L., On the hybrid flowshop scheduling problem, International Journal of Production Economics, 113, 1, 495-497 (2008)
[66] Haouari, M.; Hidri, L.; Gharbi, A., Optimal scheduling of a two-stage hybrid flow shop, Mathematical Methods of Operations Research, 64, 1, 107-124 (2006) · Zbl 1131.90023
[67] Haouari, M.; M’Hallah, R., Heuristic algorithms for the two-stage hybrid flowshop problem, Operations Research Letters, 21, 1, 43-53 (1997) · Zbl 0885.90055
[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.; 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.; Babayan, A., Scheduling manufacturing systems for delayed product differentiation in agile manufacturing, International Journal of Production Research, 40, 11, 2461-2481 (2002) · Zbl 1064.90526
[70] He, D.; Babayan, A.; Kusiak, A., Scheduling manufacturing systems in an agile environment, Robotics and Computer Integrated Manufacturing, 17, 1-2, 87-97 (2001)
[71] He, D. W.; Kusiak, A.; Artiba, A., A scheduling problem in glass manufacturing, IIE Transactions, 28, 2, 129-139 (1996)
[72] Hong, T. P.; Wang, T. T., Fuzzy flexible flow shops at two machine centers for continuous fuzzy domains, Information Sciences, 129, 1-4, 227-237 (2000) · Zbl 0996.90043
[73] Hong, T. P.; Wang, T. T.; Wang, S. L., A palmer-based continuous fuzzy flexible flow-shop scheduling algorithm, International Journal of Soft Computing, 5, 6, 426-433 (2001) · Zbl 1061.68518
[74] Hoogeveen, J. A.; Lenstra, J. K.; Veltman, B., Preemptive scheduling in a two-stage multiprocessor flow shop is np-hard, European Journal of Operational Research, 89, 1, 172-175 (1996) · Zbl 0908.90164
[75] Huang, W.; Li, S., A two-stage hybrid flowshop with uniform machines and setup times, Mathematical and Computer Modelling, 27, 2, 27-45 (1998) · Zbl 1185.90078
[76] Huang, Y. M.; 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, 691-704 (2008)
[77] Hunsucker, J. L.; Shah, J. R., Performance of priority rules in a due date flow-shop, Omega-International Journal of Management Science, 20, 1, 73-89 (1992)
[78] Hunsucker, J. L.; 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, 102-114 (1994) · Zbl 0800.90570
[79] Janiak, A.; Kozan, E.; Lichtenstein, M.; Oguz, C., Metaheuristic approaches to the hybrid flow shop scheduling problem with a cost-related criterion, International Journal of Production Economics, 105, 2, 407-424 (2007)
[80] Jayamohan, M. S.; Rajendran, C., A comparative analysis of two different approaches to scheduling in flexible flow shops, Production Planning and Control, 11, 6, 572-580 (2000)
[81] Jenabi, M.; Fatemi Ghomi, S. M.T.; Torabi, S. A.; 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, 230-245 (2007) · Zbl 1127.90029
[82] M.T. Jensen, Robust and Flexible Scheduling with Evolutionary Computation, Ph.D. Thesis, Department of Computer Science, University of Aarhus, 2001.; 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.; Elmaghraby, S. E., Scheduling hybrid flowshops in printed circuit board assembly lines, Production and Operations Management, 11, 2, 216-230 (2002)
[84] Jin, Z. H.; Yang, Z.; Ito, T., Metaheuristic algorithms for the multistage hybrid flowshop scheduling problem, International Journal of Production Economics, 100, 2, 322-334 (2006)
[85] Jungwattanakit, J.; Reodecha, M.; Chaovalitwongse, P.; 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, 354-370 (2008)
[86] Jungwattanakit, J.; Reodecha, M.; Chaovalitwongse, P.; 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, 358-378 (2009) · Zbl 1157.90417
[87] Kaczmarczyky, W.; Sawik, T. J.; Schaller, A.; Tirpak, T. M., Optimal versus heuristic scheduling of surface mount technology lines, International Journal of Production Research, 42, 10, 2083-2110 (2004) · Zbl 1094.90557
[88] Kadipasaoglu, S. N.; Xiang, W.; Khumawala, B. M., A comparison of sequencing rules in static and dynamic hybrid flow systems, International Journal of Production Research, 35, 5, 1359-1384 (1997) · Zbl 0942.90519
[89] Kadipasaoglu, S. N.; Xiang, W.; Khumawala, B. M., A note on scheduling hybrid flow systems, International Journal of Production Research, 35, 5, 1491-1494 (1997) · Zbl 0939.90535
[90] Kim, J. S.; Kang, S. H.; 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, 547-555 (1997)
[91] Kim, Y.-D.; Joo, B.-J.; 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, 19-42 (2009) · Zbl 1180.90127
[92] Kis, T.; Pesch, E., A review of exact solution methods for the non-preemptive multiprocessor flowshop problem, European Journal of Operational Research, 164, 3, 592-608 (2005) · Zbl 1057.90015
[93] Kochhar, S.; Morris, R. J.T., Heuristic methods for flexible flow line scheduling, Journal of Manufacturing Systems, 6, 4, 299-314 (1987)
[94] Kochhar, S.; Morris, R. J.T.; Wong, W. S., The local search approach to flexible flow line scheduling, Engineering Costs and Production Economics, 14, 1, 25-37 (1988)
[95] Koulamas, C.; Kyparisis, G. J., Asymptotically optimal linear time algorithms for two-stage and three-stage flexible flow shops, Naval Research Logistics, 47, 3, 259-268 (2000) · Zbl 0956.90009
[96] Koulamas, C.; Kyparisis, G. J., A note on performance guarantees for sequencing three-stage flexible flowshops with identical machines to minimize makespan, IIE Transactions, 39, 5, 559-563 (2007)
[97] Kouvelis, P.; Vairaktarakis, G., Flowshops with processing flexibility across production stages, IIE Transactions, 30, 8, 735-746 (1998)
[98] Kuo, Y.; Yang, T.; Cho, C.; 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, 40-56 (2008) · Zbl 1216.90053
[99] Kurz, M. E.; Askin, R. G., An adaptable problem-space-based search method for flexible flow line scheduling, IIE Transactions, 33, 8, 691-693 (2001)
[100] Kurz, M. E.; Askin, R. G., Comparing scheduling rules for flexible flow lines, International Journal of Production Economics, 85, 3, 371-388 (2003)
[101] Kurz, M. E.; Askin, R. G., Scheduling flexible flow lines with sequence-dependent setup times, European Journal of Operational Research, 159, 1, 66-82 (2004) · Zbl 1067.90045
[102] Kyparisis, G. J.; Koulamas, C., A note on weighted completion time minimization in a flexible flow shop, Operations Research Letters, 29, 1, 5-11 (2001) · Zbl 0981.90025
[103] Kyparisis, G. J.; Koulamas, C., Flexible flow shop scheduling with uniform parallel machines, European Journal of Operational Research, 168, 3, 985-997 (2006) · Zbl 1083.90022
[104] Kyparisis, G. J.; Koulamas, C., A note on makespan minimization in two-stage flexible flow shops with uniform machines, European Journal of Operational Research, 175, 2, 1321-1327 (2006) · Zbl 1142.90404
[105] Lee, C. Y.; Vairaktarakis, G. L., Minimizing makespan in hybrid flowshops, Operations Research Letters, 16, 3, 149-158 (1994) · Zbl 0812.90066
[106] Lee, C. Y.; Vairaktarakis, G. L., Performance comparison of some classes of flexible flow shops and job shops, International Journal of Flexible Manufacturing Systems, 10, 4, 379-405 (1998)
[107] Lee, G. C., Estimating order lead times in hybrid flowshops with different scheduling rules, Computers and Industrial Engineering, 56, 4, 1668-1674 (2009)
[108] Lee, G.-C.; 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, 4731-4743 (2004) · Zbl 1069.90115
[109] Lee, Y.-D.; Kim, G.-C.; Choi, S.-W., Bottleneck-focused scheduling for a hybrid flowshop, International Journal of Production Research, 42, 1, 165-181 (2004) · Zbl 1052.90559
[110] Leon, V. J.; Ramamoorthy, B., An adaptable problem-space-based search method for flexible flow line scheduling, IIE Transactions, 29, 2, 115-125 (1997)
[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, 142-156 (1997) · Zbl 0955.90017
[112] Lin, H.-T.; 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, 133-143 (2003)
[113] Linn, R.; Zhang, W., Hybrid flow shop scheduling: a survey, Computers and Industrial Engineering, 37, 1-2, 57-61 (1999)
[114] Liu, C.-Y.; Chang, S.-C., Scheduling flexible flow shops with sequence-dependent setup effects, IEEE Transactions on Robotics and Automation, 16, 4, 408-419 (2000)
[115] Liu, J. Y., Single-job lot streaming in m-1 two-stage hybrid flowshops, European Journal of Operational Research, 187, 3, 1171-1183 (2008) · Zbl 1137.90506
[116] Liu, Y.; Karimi, I. A., Scheduling multistage batch plants with parallel units and no interstage storage, Computers and Chemical Engineering, 32, 4-5, 671-693 (2008)
[117] Logendran, R.; Carson, S.; Hanson, E., Group scheduling in flexible flow shops, International Journal of Production Economics, 96, 2, 143-155 (2005)
[118] Logendran, R.; deSzoeke, P.; Barnard, F., Sequence-dependent group scheduling problems in flexible flow shops, International Journal of Production Economics, 102, 1, 66-86 (2006)
[119] Low, C. Y., Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines, Computers and Operations Research, 32, 8, 2013-2025 (2005) · Zbl 1068.90060
[120] Low, C. Y.; Hsu, C. J.; Su, C. T., A two-stage hybrid flowshop scheduling problem with a function constraint and unrelated alternative machines, Computers and Operations Research, 35, 3, 845-853 (2008) · Zbl 1278.90165
[121] Braglia, M.; Petroni, A., Data envelopment analysis for dispatching rule selection, Production Planning and Control, 10, 5, 454-461 (1999)
[122] Minella, G.; Ruiz, R.; Ciavotta, M., A review and evaluation of multi-objective algorithms for the flowshop scheduling problem, INFORMS Journal on Computing, 20, 3, 451-471 (2008) · Zbl 1243.90069
[123] Mittal, B. S.; Bagga, P. C., Two machine sequencing problem with parallel machines, OPSEARCH: Journal of the Operational Research Society of India, 10, 50-61 (1973)
[124] Morita, H.; 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, 46-52 (2005)
[125] Moursli, O.; Pochet, Y., A branch-and-bound algorithm for the hybrid flowshop, International Journal of Production Economics, 64, 1-3, 113-125 (2000)
[126] Naderi, B.; Zandieh, M.; Khaleghi Ghoshe Balagh, A.; 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, 9625-9633 (2009)
[127] Naderi, B.; Zandieh, M.; 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, 1186-1198 (2009)
[128] Narasimhan, S. L.; Mangiameli, P. M., A comparison of sequencing rules for a two-stage hybrid flowshop, Decision Sciences, 18, 2, 250-265 (1987)
[129] Narasimhan, S. L.; Panwalkar, S. S., Scheduling in a two-stage manufacturing process, International Journal of Production Research, 22, 4, 555-564 (1984)
[130] Negenman, E. G., Local search algorithms for the multiprocessor flow shop scheduling problem, European Journal of Operational Research, 128, 1, 147-158 (2001) · Zbl 0984.90017
[131] Nowicki, E.; Smutnicki, C., The flow shop with parallel machines: a tabu search approach, European Journal of Operational Research, 106, 2-3, 226-253 (1998) · Zbl 0991.90059
[132] NTron, E.; Baptiste, P.; Gupta, J. N.D., Solving hybrid flow shop problem using energetic reasoning and global operations, Omega-International Journal of Management Science, 29, 6, 501-511 (2001)
[133] Oguz, C.; Ercan, M., A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks, Journal of Scheduling, 8, 4, 323-351 (2005) · Zbl 1123.90314
[134] Oguz, C.; Ercan, M. F., Scheduling multiprocessor tasks in a two-stage flow-shop environment, Computers and Industrial Engineering, 33, 1-2, 269-272 (1997)
[135] Oguz, C.; Ercan, M. F.; Cheng, T. C.E.; Fung, Y. F., Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop, European Journal of Operational Research, 149, 2, 390-403 (2003) · Zbl 1059.90072
[136] Oguz, C.; Zinder, Y.; Do, V.; Janiak, A.; Lichtenstein, M., Hybrid flow-shop scheduling problems with multiprocessor task systems, European Journal of Operational Research, 152, 1, 115-131 (2004) · Zbl 1044.90036
[137] Guinet, A. G.P., Textile production systems: a succession of non-identical parallel processor shops, Journal of the Operational Research Society, 42, 8, 655-671 (1991) · Zbl 0729.90754
[138] Paul, R. J., Production scheduling problem in the glass-container industry, Operations Research, 27, 2, 290-302 (1979)
[139] Pearn, W. L.; Chung, S. H.; Yang, M. H.; Chen, C. Y., The integrated circuit packaging scheduling problem (icpsp): a case study, International Journal of Industrial Engineering-Theory Applications and Practice, 12, 3, 296-307 (2005)
[140] Phadnis, S.; Brevick, J.; 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, 87-97 (2003)
[141] Pinedo, M., Scheduling: Theory Algorithms and Systems (2002), Prentice Hall: Prentice Hall Upper Saddle, NJ · Zbl 1145.90394
[142] Piramuthu, S.; Raman, N.; Shaw, M. J., Learning-based scheduling in a flexible manufacturing flow line, IEEE Transactions on Engineering Management, 41, 2, 172-182 (1994)
[143] Piramuthu, S.; Raman, N.; Shaw, M. J., Decision support system for scheduling a flexible flow system: incorporation of feature construction, Annals of Operations Research, 78, 219-234 (1998) · Zbl 0899.90113
[144] Portmann, M. C.; Vignier, A.; Dardilhac, D.; Dezalay, D., Branch and bound crossed with GA to solve hybrid flowshops, European Journal of Operational Research, 107, 2, 389-400 (1998) · Zbl 0943.90038
[145] Quadt, D.; Kuhn, D., A taxonomy of flexible flow line scheduling procedures, European Journal of Operational Research, 178, 3, 686-698 (2007) · Zbl 1163.90508
[146] Rajendran, C.; Chaudhuri, D., A multistage parallel-processor flowshop problem with minimum flowtime, European Journal of Operational Research, 57, 1, 111-122 (1992) · Zbl 0767.90040
[147] Rajendran, C.; Chaudhuri, D., Scheduling in \(n\)-jobs \(m\) stage flowshop with parallel processors to minimize makespan, International Journal of Production Economics, 27, 2, 137-143 (1992)
[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, 135-144 (1970)
[149] Riane, F.; Artiba, A.; Elmaghraby, S. E., A hybrid three-stage flowshop problem: efficient heuristics to minimize makespan, European Journal of Operational Research, 109, 2, 321-329 (1998) · Zbl 0937.90035
[150] Riane, F.; Artiba, A.; Elmaghraby, S. E., Sequencing a hybrid two-stage flowshop with dedicated machines, International Journal of Production Research, 40, 17, 4353-4380 (2002) · Zbl 1064.90545
[151] Riane, F.; Artiba, A.; Iassinovski, S., An integrated production planning and scheduling system for hybrid flowshop organizations, International Journal of Production Economics, 74, 1-3, 33-48 (2001)
[152] Ruiz, R.; Maroto, C., A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility, European Journal of Operational Research, 169, 3, 781-800 (2006) · Zbl 1079.90061
[153] Ruiz, R.; Serifoglu, F. S.; Urlings, T., Modeling realistic hybrid flexible flowshop scheduling problems, Computers and Operations Research, 35, 4, 1151-1175 (2008) · Zbl 1180.90135
[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.; 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. · Zbl 0297.90036
[155] Santos, D. L.; Hunsucker, J. L.; Deal, D. E., Flowmult: permutation sequences for flow shops with multiple processors, Journal of Information and Optimization Sciences, 16, 2, 351-366 (1995) · Zbl 0861.90076
[156] Santos, D. L.; Hunsucker, J. L.; Deal, D. E., Global lower bounds for flow shops with multiple processors, European Journal of Operational Research, 80, 1, 112-120 (1995) · Zbl 0927.90052
[157] Santos, D. L.; Hunsucker, J. L.; Deal, D. E., An evaluation of sequencing heuristics in flow shops with multiple processors, Computers and Industrial Engineering, 30, 4, 681-691 (1996)
[158] Santos, D. L.; Hunsucker, J. L.; Deal, D. E., On makespan improvement in flow shops with multiple processors, Production Planning and Control, 12, 3, 283-295 (2001)
[159] Sawik, T., Integer programming approach to reactive scheduling in make-to-order manufacturing, Mathematical and Computer Modelling, 46, 11-12, 1373-1387 (2007) · Zbl 1170.90398
[160] Sawik, T. J., A scheduling algorithm for flexible flow lines with limited intermediate buffers, Applied Stochastic Models and Data Analysis, 9, 2, 127-138 (1993)
[161] Sawik, T. J., Scheduling flexible flow lines with no in-process buffers, International Journal of Production Research, 33, 5, 1357-1367 (1995) · Zbl 0916.90156
[162] Sawik, T. J., Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers, Mathematical and Computer Modelling, 31, 13, 39-52 (2000) · Zbl 0969.90048
[163] Sawik, T. J., Mixed integer programming for scheduling surface mount technology lines, International Journal of Production Research, 39, 14, 3219-3235 (2001) · Zbl 1060.90690
[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, 461-471 (2002) · Zbl 1052.90038
[165] Sawik, T. J., Integer programming approach to production scheduling for make-to-order manufacturing, Mathematical and Computer Modelling, 41, 1, 99-118 (2005) · Zbl 1068.90064
[166] Sawik, T. J.; Schaller, A.; Tirpak, T. M., Scheduling of printed wiring board assembly in surface mount technology lines, Journal of Electronics Manufacturing, 11, 1, 1-17 (2002)
[167] Schuurman, P.; Woeginger, G. J., A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem, Theoretical Computer Science, 237, 1-2, 105-122 (2000) · Zbl 0943.68009
[168] Serifoglu, F. S.; Ulusoy, G., Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach, Journal of the Operational Research Society, 55, 5, 504-512 (2004) · Zbl 1070.90046
[169] Sevastianov, S. V., Geometrical heuristics for multiprocessor flowshop scheduling with uniform machines at each stage, Journal of Scheduling, 5, 3, 205-225 (2002) · Zbl 1009.90044
[170] Sherali, H. D.; Sarin, S. C.; Kodialam, M. S., Models and algorithms for a two-stage production process, Production Planning and Control, 1, 1, 27-39 (1990)
[171] Shiau, D. F.; Cheng, S. C.; Huang, Y. M., Proportionate flexible flow shop scheduling via a hybrid constructive genetic algorithm, Expert Systems with Applications, 34, 2, 1133-1143 (2008)
[172] Sirikrai, V.; 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, 3509-3531 (2006) · Zbl 1094.90564
[173] Soewandi, H.; Elmaghraby, S. E., Sequencing three-stage flexible flowshops with identical machines to minimize makespan, IIE Transactions, 33, 11, 985-993 (2001)
[174] Soewandi, H.; Elmaghraby, S. E., Sequencing on two-stage hybrid flowshops with uniform machines to minimize makespan, IIE Transactions, 35, 5, 467-477 (2003)
[175] Sriskandarajah, C.; Sethi, S. P., Scheduling algorithms for flexible flowshops: worst and average case performance, European Journal of Operational Research, 43, 2, 143-160 (1989) · Zbl 0691.90038
[176] Sundararaghavan, P. S.; Kunnathur, A. S.; Viswanathan, I., Minimizing makespan in parallel flowshops, Journal of the Operational Research Society, 48, 8, 834-842 (1997) · Zbl 0890.90110
[177] Sung, C. S.; Kim, H. A., A two-stage multiple-machine assembly scheduling problem for minimizing sum of completion times, International Journal of Production Economics, 113, 2, 1038-1048 (2008)
[178] Suresh, V., A note on scheduling of two-stage flow shop with multiple processors, International Journal of Production Economics, 49, 1, 77-82 (1997)
[179] Takaku, K.; 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, 21-25 (2005)
[180] Tang, L. X.; Liu, W. X.; 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, 361-370 (2005)
[181] Tang, L. X.; Xuan, H., Lagrangian relaxation algorithms for real-time hybrid flowshop scheduling with finite intermediate buffers, Journal of the Operational Research Society, 57, 3, 316-324 (2006) · Zbl 1089.90029
[182] Tang, L. X.; Xuan, H.; Liu, J. Y., A new lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time, Computers and Operations Research, 33, 11, 3344-3359 (2006) · Zbl 1113.90064
[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.; 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. · Zbl 1082.68710
[184] Tavakkoli-Moghaddam, R.; Safaei, N.; Sassani, F., A memetic algorithm for the flexible flow line scheduling problem with processor blocking, Computers and Operations Research, 36, 2, 402-414 (2009) · Zbl 1157.90428
[185] Thornton, H. W.; 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, 96-114 (2004) · Zbl 1043.90034
[186] T’kindt, V.; Billaut, J.-C., Multicriteria Scheduling: Theory, Models and Algorithms (2006), Springer: Springer Berlin · Zbl 1014.90046
[187] Tseng, C. T.; Liao, C. J., A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks, International Journal of Production Research, 46, 17, 4655-4670 (2008) · Zbl 1159.90408
[188] Tseng, C. T.; Liao, C. J.; Liao, T. X., A note on two-stage hybrid flowshop scheduling with missing operations, Computers and Industrial Engineering, 54, 3, 695-704 (2008)
[189] Tsubone, H.; Ohba, M.; Takamuki, H.; Miyake, Y., A production scheduling system for a hybrid flow-shop: a case-study, Omega-International Journal of Management Science, 21, 2, 205-214 (1993)
[190] Tsubone, H.; Ohba, M.; 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, 3037-3053 (1996) · Zbl 0927.90042
[191] Tsubone, H.; Suzuki, M.; Uetake, T.; Ohba, M., A comparison between basic cyclic scheduling and variable cyclic scheduling in a two-stage hybrid flow shop, Decision Sciences, 31, 1, 197-222 (2000)
[192] Uetake, T.; Tsubone, H.; Ohba, M., A production scheduling system in a hybrid flow shop, International Journal of Production Economics, 41, 1-3, 395-398 (1995)
[193] Vairaktarakis, G.; Elhafsi, M., The use of flowlines to simplify routing complexity in two-stage flowshops, IIE Transactions, 32, 8, 687-699 (2000)
[194] Vandevelde, A.; Hoogeveen, H.; Hurkens, C.; 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, 305-320 (2005) · Zbl 1239.68018
[195] Verma, S. K.; Dessouky, M. I., Multistage hybrid flowshop scheduling with identical jobs and uniform parallel machines, Journal of Scheduling, 2, 135-150 (1999) · Zbl 0963.90030
[196] Vignier, A.; Billaut, J.-C.; Proust, C., Les problFmes d’ordonnancement de type flow-shop hybride: Ttat de l’art, RAIRO Recherche OpTrationnelle, 33, 2, 117-183 (1999) · Zbl 0960.90042
[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.; 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.; 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\); A. Vignier, D. Dardilhac, D. Dezalay, C. Proust, A branch and bound approach to minimize the total completion time in a \(k\)
[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.; 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.; 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, 445-458 (2007)
[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.; 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.; Salhi, A., A synergy exploiting evolutionary approach to complex scheduling problems, (Bogle, I. D.L.; Žilinskas, J., Computer Aided Methods in Optimal Design and Operations. Computer Aided Methods in Optimal Design and Operations, Series on Computers and Operations Research (2006), World Scientific Publishing Co. Pvt. Ltd.), 59-68 · Zbl 1113.90066
[204] Vázquez Rodríguez, J. A.; Salhi, A., A robust meta-hyper-heuristic approach to hybrid flow shop scheduling, (Dahal, K. P.; Tan, K. C.; Cowling, P. I., Evolutionary Scheduling Studies in Computational Intelligence (2007), Springer-Verlag: Springer-Verlag Berlin Heidelberg), 125-142, (Chapter 5) · Zbl 1200.90091
[205] Wang, H., Flexible flow shop scheduling: optimum, heuristics and artificial intelligence solutions, Expert Systems, 22, 2, 78-85 (2005)
[206] Wang, H.; Jacob, V.; Rolland, E., Design of efficient hybrid neural networks for flexible flow shop scheduling, Expert Systems, 20, 4, 208-231 (2003)
[207] Wang, X.; Tang, L., A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers, Computers and Operations Research, 36, 3, 907-918 (2009) · Zbl 1157.90429
[208] Wardono, B.; Fathi, Y., A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities, European Journal of Operational Research, 155, 2, 380-401 (2004) · Zbl 1045.90035
[209] Wittrock, R. J., Scheduling algorithms for flexible flow lines, IBM Journal of Research and Development, 29, 4, 401-412 (1985)
[210] Wittrock, R. J., An adaptable scheduling algorithm for flexible flow lines, Operations Research, 36, 3, 445-453 (1988) · Zbl 0646.90039
[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.; 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.; 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.; Wang, X. J., Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints, Computers and Mathematics with Applications, 50, 10-12, 1629-1638 (2005) · Zbl 1127.90036
[214] Xie, J. X.; Xing, W. X.; Liu, Z. X.; Dong, J. F., Minimum deviation algorithm for two-stage no-wait flowshops with parallel machines, Computers and Mathematics with Applications, 47, 12, 1857-1863 (2004) · Zbl 1057.90023
[215] Xuan, H.; Tang, L., Scheduling a hybrid flowshop with batch production at the last stage, Computers and Operations Research, 34, 9, 2718-2733 (2007) · Zbl 1141.90435
[216] Yang, T.; Kuo, Y.; Chang, I., Tabu-search simulation optimization approach for flow-shop scheduling with multiple processors – a case study, International Journal of Production Research, 42, 19, 4015-4030 (2004) · Zbl 1060.90654
[217] Yang, T.; Kuo, Y.; Cho, C., A genetic algorithms simulation approach for the multi-attribute combinatorial dispatching decision problem, European Journal of Operational Research, 176, 3, 1859-1873 (2007) · Zbl 1110.90060
[218] Y. Yang, Optimization and Heuristic Algorithms for Flexible Flow Shop Scheduling, Ph.D. Thesis, Columbia University, 1998.; Y. Yang, Optimization and Heuristic Algorithms for Flexible Flow Shop Scheduling, Ph.D. Thesis, Columbia University, 1998.
[219] Yanney, J. D.; Kuo, W., A practical approach to scheduling a multistage, multiprocessor flowshop problem, International Journal of Production Research, 27, 10, 1733-1742 (1989)
[220] Yaurima, V.; Burtseva, L.; Tchernykh, A., Hybrid flowshop with unrelated machines, sequence-dependent setup time, availability constraints and limited buffers, Computers and Industrial Engineering, 56, 4, 1452-1463 (2009)
[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, 810-817 (2009) · Zbl 1171.90412
[222] Ying, K. C.; Lin, S. W., Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach, International Journal of Production Research, 44, 16, 3161-3177 (2006) · Zbl 1159.90409
[223] Ying, K. C.; Lin, S. W., Scheduling multistage hybrid flowshops with multiprocessor tasks by an effective heuristic, International Journal of Production Research, 47, 13, 3525-3538 (2009) · Zbl 1198.90217
[224] Zandieh, M.; Fatemi Ghomi, S. M.T.; Moattar Husseini, S. M., An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times, Applied Mathematics and Computation, 180, 1, 111-127 (2006) · Zbl 1102.90029
[225] Zhang, W.; Yin, C. Y.; Liu, J. Y.; 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, 189-200 (2005)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.