Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective. (English) Zbl 1183.90189
Summary: In this paper, an extensive review of recently published papers on hybrid flow shop (HFS) scheduling problems is presented. The papers are classified first according to the HFS characteristics and production limitations considered in the respective papers. This represents a new approach to the classification of papers in the HFS environment. Second, the papers have been classified according to the solution approach proposed. These two classification categories give a comprehensive overview on the state of the art of the problem and can guide the reader with respect to future research work.
Keywords:
hybrid flow shopReferences:
| [1] | Johnson, S. M., Optimal two-and three-stage production schedules with set up times included, Naval Research Logistics Quarterly, 1, 61-68 (1954) · Zbl 1349.90359 |
| [2] | Salvador, M. S., A solution to a special class of flow shop scheduling problems, (Elmaghraby, S. E., Symposium on the theory of scheduling and its applications (1973), Springer: Springer Berlin), 83-91 · Zbl 0297.90036 |
| [3] | Garey, M. R.; Johnson, D. S., Computers and intractability: a guide to the theory of NP-completness (1979), Freeman: Freeman San Francisco · Zbl 0411.68039 |
| [4] | Vignier, A.; Billaut, J. C.; Proust, C., Hybrid flowshop scheduling problems: state of the art, Rairo-Recherche Operationnelle-Operations Research, 33, 2, 117-183 (1999) · Zbl 0960.90042 |
| [5] | Linn, R.; Zhang, W., Hybrid flow shop scheduling: a survey, Computers & Industrial Engineering, 37, 1-2, 57-61 (1999) |
| [6] | Kis, T.; Pesch, E., A review of exact solution methods for the non-preemptive multiprocessor flowshop problem, Eur J Oper Res, 164, 3, 592-608 (2005) · Zbl 1057.90015 |
| [7] | Wang, H., Flexible flow shop scheduling: optimum, heuristics and artificial intelligence solutions, Expert Syst, 22, 2, 78-85 (2005) |
| [8] | Quadt, D.; Kuhn, H., A taxonomy of flexible flow line scheduling procedures, Eur J Oper Res, 178, 3, 686-698 (2007) · Zbl 1163.90508 |
| [9] | Graham, R. L.; Lawler, E. L.; Lenstra, J. K.; Rinnooy Kan, A. H.G., Optimization and approximation in deterministic sequencing and scheduling: a survey, Ann Discrete Math, 5, 287-326 (1979) · Zbl 0411.90044 |
| [10] | 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, Ann Oper Res, 69, 171-191 (1997) · Zbl 0880.90071 |
| [11] | 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, Int J Prod Econ, 96, 2, 189-200 (2005) |
| [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, 142-156 (1997) · Zbl 0955.90017 |
| [13] | Gupta, J. N.D.; Tunc, E. A., Minimizing tardy jobs in a two-stage hybrid flowshop, Int J Prod Res, 36, 9, 2397-2417 (1998) · Zbl 0945.90567 |
| [14] | Gupta, J. N.D.; Sexton, R. S.; Tunc, E. A., Selecting scheduling heuristics using neural networks, Informs J Comput, 12, 2, 150-162 (2000) · Zbl 1034.90002 |
| [15] | Lee, G. C.; 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, 4731-4743 (2004) · Zbl 1069.90115 |
| [16] | Guinet, A.; Solomon, M. M.; Kedia, P. K.; Dussauchoy, A., A computational study of heuristics for two-stage flexible flowshops, Int J Prod Res, 34, 5, 1399-1415 (1996) · Zbl 0947.90540 |
| [17] | 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 Int J Manag Sci, 25, 5, 547-555 (1997) |
| [18] | Haouari, M.; Hidri, L.; Gharbi, A., Optimal scheduling of a two-stage hybrid flow shop, Math Methods Oper Res, 64, 1, 107-124 (2006) · Zbl 1131.90023 |
| [19] | Hong, T. P.; Wang, T. T., Fuzzy flexible flow shops at two machine centers for continuous fuzzy domains, Inf Sci, 129, 1-4, 227-237 (2000) · Zbl 0996.90043 |
| [20] | Kouvelis, P.; Vairaktarakis, G., Flowshops with processing flexibility across production stages, IIE Trans, 30, 8, 735-746 (1998) |
| [21] | Soewandi, H.; Elmaghraby, S., Sequencing three-stage flexible flowshops with identical machines to minimize makespan, IIE Trans, 33, 11, 985-994 (2001) |
| [22] | Jin, Z. H.; Ohno, K.; Ito, T.; Elmaghraby, S. E., Scheduling hybrid flowshops in printed circuit board assembly lines, Prod Oper Manag, 11, 2, 216-230 (2002) |
| [23] | Tang, L. X.; Luh, P. B.; Liu, J. Y.; Fang, L., Steel-making process scheduling using Lagrangian relaxation, Int J Prod Res, 40, 1, 55-70 (2002) · Zbl 1175.90150 |
| [24] | Babayan, A.; He, D., Solving the \(n\)-job 3-stage flexible flowshop scheduling problem using an agent-based approach, Int J Prod Res, 42, 4, 777-799 (2004) · Zbl 1069.90038 |
| [25] | Santos, D. L.; Hunsucker, J. L.; Deal, D. E., Global lower bounds for flow shops with multiple processors, Eur J Oper Res, 80, 1, 112-120 (1995) · Zbl 0927.90052 |
| [26] | Santos, D. L.; Hunsucker, J. L.; Deal, D. E., An evaluation of sequencing heuristics in flow shops with multiple processors, Comput Ind Eng, 30, 4, 681-691 (1996) |
| [27] | Guinet, A. G.P.; Solomon, M. M., Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time, Int J Prod Res, 34, 6, 1643-1654 (1996) · Zbl 0927.90033 |
| [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, 362-373 (1996) |
| [29] | Nowicki, E.; Smutnicki, C., The flow shop with parallel machines: a tabu search approach, Eur J Oper Res, 106, 2-3, 226-253 (1998) · Zbl 0991.90059 |
| [30] | Portmann, M. C.; Vignier, A.; Dardilhac, D.; Dezalay, D., Branch and bound crossed with GA to solve hybrid flowshops, Eur J Oper Res, 107, 2, 389-400 (1998) · Zbl 0943.90038 |
| [31] | 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 |
| [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.; 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.; 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.; 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.; Loo, L. L., Heuristics for scheduling in a flow shop with multiple processors, Eur J Oper Res, 113, 1, 113-122 (1999) · Zbl 0933.90026 |
| [36] | Carlier, J.; Neron, E., An exact method for solving the multi-processor flow-shop, Rairo Rech Operationnelle Oper Res, 34, 1, 1-25 (2000) · Zbl 0963.90027 |
| [37] | Moursli, O.; Pochet, Y., A branch-and-bound algorithm for the hybrid flowshop, Int J Prod Econ, 64, 1-3, 113-125 (2000) |
| [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, 101-111 (2000) |
| [39] | Liu, C. Y.; Chang, S. C., Scheduling flexible flow shops with sequence-dependent setup effects, IEEE Trans Robotics Automation, 16, 408-419 (2000) |
| [40] | Santos, D. L.; Hunsucker, J. L.; Deal, D. E., On makespan improvement in flow shops with multiple processors, Prod Plann Control, 12, 3, 283-295 (2001) |
| [41] | Negenman, E. G., Local search algorithms for the multiprocessor flow shop scheduling problem, Eur J Oper Res, 128, 1, 147-158 (2001) · Zbl 0984.90017 |
| [42] | Neron, E.; Baptiste, P.; Gupta, J. N.D., Solving hybrid flow shop problem using energetic reasoning and global operations, Omega Int J Manage Sci, 29, 6, 501-511 (2001) |
| [43] | Azizoglu, M.; Cakmak, E.; Kondakci, S., A flexible flowshop problem with total flow time minimization, Eur J Oper Res, 132, 3, 528-538 (2001) · Zbl 1024.90037 |
| [44] | Kyparisis, G. J.; Koulamas, C., A note on weighted completion time minimization in a flexible flow shop, Oper Res Lett, 29, 1, 5-11 (2001) · Zbl 0981.90025 |
| [45] | Cheng, J.; Yoshiyuki, K.; Kise, H., A shifting bottleneck approach for parallel-machine flowshop scheduling problem, J Oper Res Soc Jpn, 44, 2, 141-154 (2001) |
| [46] | Djellab, H.; Djellab, K., Preemptive hybrid flowshop scheduling problem of interval orders, Eur J Oper Res, 137, 1, 37-49 (2002) · Zbl 1002.90026 |
| [47] | Wang, H.; Jacob, V.; Rolland, E., Design of efficient hybrid neural networks for flexible flow shop scheduling, Expert Syst, 20, 4, 208-231 (2003) |
| [48] | Engin, O.; Doyen, A., A new approach to solve hybrid flow shop scheduling problems by artificial immune system, Future Generation Comput Syst, 20, 6, 1083-1095 (2004) |
| [49] | Lee, G. C.; Kim, Y. D.; Choi, S. W., Bottleneck-focused scheduling for a hybrid flowshop, Int J Prod Res, 42, 1, 165-181 (2004) · Zbl 1052.90559 |
| [50] | Quadt, D., Lot-sizing and scheduling for flexible flow lines (2004), Springer: Springer Berlin, Heidelberg · Zbl 1098.90033 |
| [51] | Acero-Dominguez M, Paternina-Arboleda C. In: Jones MH, Patek SD, Tawney BE, editors. Scheduling jobs on a \(k\); Acero-Dominguez M, Paternina-Arboleda C. In: Jones MH, Patek SD, Tawney BE, editors. Scheduling jobs on a \(k\) |
| [52] | Choi, S. W.; Kim, Y. D.; Lee, G. C., Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop, Int J Prod Res, 43, 11, 2149-2167 (2005) · Zbl 1068.90056 |
| [53] | Quadt, D.; Kuhn, H., Conceptual framework for lot-sizing and scheduling of flexible flow lines, Int J Prod Res, 43, 11, 2291-2308 (2005) · Zbl 1068.90063 |
| [54] | Morita, H.; 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, 46-52 (2005) |
| [55] | 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 J Comput, 17, 3, 305-320 (2005) · Zbl 1239.68018 |
| [56] | Takaku, K.; 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, 21-25 (2005) |
| [57] | Jin, Z. H.; Yang, Z.; Ito, T., Metaheuristic algorithms for the multistage hybrid flowshop scheduling problem, Int J Prod Econ, 100, 2, 322-334 (2006) |
| [58] | Allahverdi, A.; Al-Anzi, F. S., Scheduling multi-stage parallel-processor services to minimize average response time, J Oper Res Soc, 57, 101 (2006) · Zbl 1121.90050 |
| [59] | Tang, L. X.; Xuan, H.; Liu, J. Y., A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time, Comput Oper Res, 33, 11, 3344-3359 (2006) · Zbl 1113.90064 |
| [60] | Torabi, S. A.; Ghomi, S. M.T. F.; Karimi, B., A hybrid genetic algorithm for the finite horizon economic lot and delivery scheduling in supply chains, Eur J Oper Res, 173, 1, 173-189 (2006) · Zbl 1125.90025 |
| [61] | 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, Appl Math Comput, 180, 1, 111-127 (2006) · Zbl 1102.90029 |
| [62] | Belkadi, K.; Gourgand, M.; Benyettou, M., Parallel genetic algorithms with migration for the hybrid flow shop scheduling problem, J Appl Math Decis Sci, 1-17 (2006) · Zbl 1172.90513 |
| [63] | Belkadi, K.; Gourgand, M.; Benyettou, M.; Aribi, A., Sequential and parallel genetic algorithm for the hybrid flow shop scheduling problem, J Appl Sci, 6, 4, 775-778 (2006) · Zbl 1172.90513 |
| [64] | Janiak, A.; Kozan, E.; Lichtenstein, M.; Oguz, C., Metaheuristic approaches to the hybrid flow shop scheduling problem with a cost-related criterion, Int J Prod Econ, 105, 2, 407-424 (2007) |
| [65] | Quadt, D.; Kuhn, H., Batch scheduling of jobs with identical process times on flexible flow lines, Int J Prod Econ, 105, 2, 385-401 (2007) |
| [66] | Paternina-Arboleda C, Montoya-Torres J, Acero-Dominguez M, Herrera-Hernandez M. Scheduling jobs on a \(k\); Paternina-Arboleda C, Montoya-Torres J, Acero-Dominguez M, Herrera-Hernandez M. Scheduling jobs on a \(k\) · Zbl 1169.90360 |
| [67] | Xuan, H.; Tang, L. X., Scheduling a hybrid flowshop with batch production at the last stage, Comput Oper Res, 34, 9, 2718-2733 (2007) · Zbl 1141.90435 |
| [68] | Alaykyran, K.; Engin, O.; Doyen, A., Using ant colony optimization to solve hybrid flow shop scheduling problems, Int J Adv Manuf Technol, 35, 5-6, 541-550 (2007) |
| [69] | Shiau, D. F.; Cheng, S. C.; Huang, Y. M., Proportionate flexible flow shop scheduling via a hybrid constructive genetic algorithm, Expert Syst Appl, 34, 2, 1133-1143 (2008) |
| [70] | Gupta, J. N.D.; Krüger, K.; Lauff, V.; Werner, F.; Sotskov, Y. N., Heuristics for hybrid flow shops with controllable processing times and assignable due dates, Comput Oper Res, 29, 10, 1417-1439 (2002) · Zbl 0994.90114 |
| [71] | Yang, T.; Kuo, Y.; Chang, I., Tabu-search simulation optimization approach for flow-shop scheduling with multiple processors—a case study, Int J Prod Res, 42, 19, 4015-4030 (2004) · Zbl 1060.90654 |
| [72] | 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, J Intell Manuf, 16, 3, 361-370 (2005) |
| [73] | Yang, T.; Kuo, Y.; Cho, C., A genetic algorithms simulation approach for the multi-attribute combinatorial dispatching decision problem, Eur J Oper Res, 176, 3, 1859-1873 (2007) · Zbl 1110.90060 |
| [74] | Allaoui, H.; Artiba, A., Scheduling two-stage hybrid flow shop with availability constraints, Comput Oper Res, 33, 5, 1399-1419 (2006) · Zbl 1126.90017 |
| [75] | Xie, J. X.; Wang, X. J., Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints, Comput Math Appl, 50, 10-12, 1629-1638 (2005) · Zbl 1127.90036 |
| [76] | Alisantoso, D.; Khoo, L. P.; Jiang, P. Y., An immune algorithm approach to the scheduling of a flexible PCB flow shop, Int J Adv Manuf Technol, 22, 11-12, 819-827 (2003) |
| [77] | Allaoui, H.; Artiba, A., Integrating simulation and optimization to schedule a hybrid flow shop with maintenance constraints, Comput Ind Eng, 47, 4, 431-450 (2004) |
| [78] | 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, Eur J Oper Res, 181, 1, 40-58 (2007) · Zbl 1121.90054 |
| [79] | Sawik, T., Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers, Math Comput Model, 31, 13, 39-52 (2000) · Zbl 0969.90048 |
| [80] | Akrami, B.; Karimi, B.; 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, 634-645 (2006) · Zbl 1127.90348 |
| [81] | Akkerman, R.; van Donk, D. P.; Gaalman, G., Influence of capacity- and time-constrained intermediate storage in two-stage food production systems, Int J Prod Res, 45, 13, 2955-2973 (2007) · Zbl 1126.90339 |
| [82] | Sawik, T. J., Scheduling flexible flow lines with no in-process buffers, Int J Prod Res, 33, 5, 1357-1367 (1995) · Zbl 0916.90156 |
| [83] | Thornton, H. W.; Hunsucker, J. L., A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage, Eur J Oper Res, 152, 96-114 (2004) · Zbl 1043.90034 |
| [84] | Tavakkoli-Moghaddam, R.; Safaei, N.; Sassani, F., A memetic algorithm for the flexible flow line scheduling problem with processor blocking, Comput Oper Res, 36, 2, 402-414 (2009) · Zbl 1157.90428 |
| [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, 1060-1075 (2007) · Zbl 1121.90046 |
| [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.; 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.; Bai, F. S., No-wait flexible flowshop scheduling with no-idle machines, Oper Res Lett, 33, 6, 609-614 (2005) · Zbl 1082.90042 |
| [88] | Garcia, J. M.; Lozano, S., Production and delivery scheduling problem with time windows, Comput Ind Eng, 48, 733-742 (2005) |
| [89] | Guirchoun, S.; Martineau, P.; Billaut, J., Total completion time minimization in a computer system with a server and two parallel processors, Comput Oper Res, 32, 3, 599-611 (2005) · Zbl 1077.90024 |
| [90] | Oguz, C.; Ercan, M. F., Scheduling multiprocessor tasks in a two-stage flow-shop environment, Comput Ind Eng, 33, 1-2, 269-272 (1997) |
| [91] | 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, Eur J Oper Res, 149, 2, 390-403 (2003) · Zbl 1059.90072 |
| [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.; 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.; Lichtenstein, M., Hybrid flow-shop scheduling problems with multiprocessor task systems, Eur J Oper Res, 152, 1, 115-131 (2004) · Zbl 1044.90036 |
| [94] | Serifoglu, F. S.; Ulusoy, G., Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach, J Oper Res Soc, 55, 5, 504-512 (2004) · Zbl 1070.90046 |
| [95] | Oguz, C.; Ercan, M., A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks, J Scheduling, 8, 4, 323-351 (2005) · Zbl 1123.90314 |
| [96] | Ying, K. C.; Lin, S. W., Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach, Int J Prod Res, 44, 16, 3161-3177 (2006) · Zbl 1159.90409 |
| [97] | Ying, K. C., An iterated greedy heuristic for multistage hybrid flowshop scheduling problems with multiprocessor tasks, J Oper Res Soc, 60, 810-817 (2009) · Zbl 1171.90412 |
| [98] | Brucker, P.; Krämer, A., Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems, Eur J Oper Res, 90, 2, 214-226 (1996) · Zbl 0916.90144 |
| [99] | Huang, W.; Li, S., A two-stage hybrid flowshop with uniform machines and setup times, Math Comput Model, 27, 2, 27-45 (1998) · Zbl 1185.90078 |
| [100] | Dessouky, M. M.; Dessouky, M. I.; Verma, S. K., Flowshop scheduling with identical jobs and uniform parallel machines, Eur J Oper Res, 109, 3, 620-631 (1998) · Zbl 0936.90022 |
| [101] | Soewandi, H.; Elmaghraby, S. E., Sequencing on two-stage hybrid flowshops with uniform machines to minimize makespan, IIE Trans, 35, 5, 467-477 (2003) |
| [102] | Kyparisis, G. J.; Koulamas, C., A note on makespan minimization in two-stage flexible flow shops with uniform machines, Eur J Oper Res, 175, 2, 1321-1327 (2006) · Zbl 1142.90404 |
| [103] | Bertel, S.; Billaut, J-., A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation, Eur J Oper Res, 159, 3, 651-662 (2004) · Zbl 1065.90032 |
| [104] | Sevastianov, S. V., Geometrical heuristics for multiprocessor flowshop scheduling with uniform machines at each stage, J Scheduling, 5, 3, 205-225 (2002) · Zbl 1009.90044 |
| [105] | Kyparisis, G. J.; Koulamas, C., Flexible flow shop scheduling with uniform parallel machines, Eur J Oper Res, 168, 3, 985-997 (2006) · Zbl 1083.90022 |
| [106] | Verma, S. K.; Dessouky, M. M., Multistage hybrid flowshop scheduling with identical jobs and uniform parallel machines, J Scheduling, 2, 135-150 (1999) · Zbl 0963.90030 |
| [107] | Voss, S.; 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, 445-458 (2007) |
| [108] | Kadipasaoglu, S. N.; Xiang, W.; Khumawala, B. M., A note on scheduling hybrid flow systems, Int J Prod Res, 35, 5, 1491-1494 (1997) · Zbl 0939.90535 |
| [109] | Kadipasaoglu, S. N.; Xiang, W.; Khumawala, B. M., A comparison of sequencing rules in static and dynamic hybrid flow systems, Int J Prod Res, 35, 5, 1359-1384 (1997) · Zbl 0942.90519 |
| [110] | Suresh, V., A note on scheduling of two-stage flow shop with multiple processors, Int J Prod Econ, 49, 1, 77-82 (1997) |
| [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.; 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. · Zbl 1157.90417 |
| [112] | Hayrinen, T.; Johnsson, M.; Johtela, T.; Smed, J.; Nevalainen, O., Scheduling algorithms for computer-aided line balancing in printed circuit board assembly, Prod Plann Control, 11, 5, 497-510 (2000) |
| [113] | Low, C., Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines, Comput Oper Res, 32, 2013-2025 (2005) · Zbl 1068.90060 |
| [114] | Jenabi, M.; Ghomi, S. M.T. F.; Torabi, S. A.; Karimi, B., Two hybrid meta-heuristics for the finite horizon ELSP in flexible flow lines with unrelated parallel machines, Appl Math Comput, 186, 1, 230-245 (2007) · Zbl 1127.90029 |
| [115] | Sawik, T., Integer programming approach to production scheduling for make-to-order manufacturing, Math Comput Model, 41, 1, 99-118 (2005) · Zbl 1068.90064 |
| [116] | Sawik, T., Hierarchical approach to production scheduling in make-to-order assembly, Int J Prod Res, 44, 4, 801-830 (2006) · Zbl 1094.90016 |
| [117] | Low, C. Y.; Hsu, C. J.; Su, C. T., A two-stage hybrid flowshop scheduling problem with a function constraint and unrelated alternative machines, Comput Oper Res, 35, 3, 845-853 (2008) · Zbl 1278.90165 |
| [118] | He, L. M.; Sun, S. J.; Luo, R. Z., A hybrid two-stage flowshop scheduling problem, Asia Pac J Oper Res, 24, 1, 45-56 (2007) · Zbl 1137.90491 |
| [119] | Oguz, C.; Lin, B. M.T.; Cheng, T. C.E., Two-stage flowshop scheduling with a common second-stage machine, Comput Oper Res, 24, 12, 1169-1174 (1997) · Zbl 0883.90067 |
| [120] | Riane, F.; Artiba, A.; Elmaghraby, S. E., Sequencing a hybrid two-stage flowshop with dedicated machines, Int J Prod Res, 40, 17, 4353-4380 (2002) · Zbl 1064.90545 |
| [121] | Uetake, T.; Tsubone, H.; Ohba, M., A production scheduling system in a hybrid flow shop, Int J Prod Econ, 41, 1-3, 395-398 (1995) |
| [122] | Tsubone, H.; Ohba, M.; 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, 3037-3053 (1996) · Zbl 0927.90042 |
| [123] | 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, Decis Sci, 31, 1, 197-222 (2000) |
| [124] | Riane, F.; Artiba, A.; Elmaghraby, S. E., A hybrid three-stage flowshop problem: efficient heuristics to minimize makespan, Eur J Oper Res, 109, 2, 321-329 (1998) · Zbl 0937.90035 |
| [125] | Lin, H. T.; 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, 133-143 (2003) |
| [126] | Ruiz, R.; Maroto, C., A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility, Eur J Oper Res, 169, 3, 781-800 (2006) · Zbl 1079.90061 |
| [127] | Ruiz, R.; Serifoglu, F. S.; Urlings, T., Modeling realistic hybrid flexible flowshop scheduling problems, Comput Oper Res, 35, 4, 1151-1175 (2008) · Zbl 1180.90135 |
| [128] | Allahverdi, A.; Ng, C. T.; Cheng, T. C.E.; Kovalyov, M. Y., A survey of scheduling problems with setup times or costs, Eur J Oper Res, 187, 3, 985-1032 (2008) · Zbl 1137.90474 |
| [129] | Kurz, M. E.; Askin, R. G., Comparing scheduling rules for flexible flow lines, Int J Prod Econ, 85, 3, 371-388 (2003) |
| [130] | Kurz, M. E.; Askin, R. G., Scheduling flexible flow lines with sequence-dependent setup times, Eur J Oper Res, 159, 1, 66-82 (2004) · Zbl 1067.90045 |
| [131] | Logendran, R.; Carson, S.; Hanson, E., Group scheduling in flexible flow shops, Int J Prod Econ, 96, 2, 143-155 (2005) |
| [132] | Logendran, R.; deSzoeke, P.; Barnard, F., Sequence-dependent group scheduling problems in flexible flow shops, Int J Prod Econ, 102, 1, 66-86 (2006) |
| [133] | Tang, L. X.; 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, 788-793 (2005) · Zbl 1082.68710 |
| [134] | Jungwattanakit, J.; Reodecha, M.; Chaovalitwongse, P.; 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, 354-370 (2008) |
| [135] | Leon, V. J.; Ramamoorthy, B., An adaptable problem-space-based search method for flexible flow line scheduling, IIE Trans, 29, 2, 115-125 (1997) |
| [136] | Kurz, M. E.; Askin, R. G., An adaptable problem-space-based search method for flexible flow line scheduling, IIE Trans, 33, 8, 691-693 (2001) |
| [137] | Tseng, C. T.; Liao, C. J.; Liao, T. X., A note on two-stage hybrid flowshop scheduling with missing operations, Comput Ind Eng, 54, 3, 695-704 (2008) |
| [138] | T’kindt, V.; Billaut, J. C., Multicriteria scheduling: çtheory, models and algorithms (2002), Springer: Springer Berlin · Zbl 1106.90035 |
| [139] | Gupta, J. N.D., Two-stage, hybrid flow shop scheduling problem, J Oper Res Soc, 39, 4, 359-364 (1988) · Zbl 0639.90049 |
| [140] | Hoogeveen, J. A.; Lenstra, J. K.; Veltman, B., Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard, Eur J Oper Res, 89, 1, 172-175 (1996) · Zbl 0908.90164 |
| [141] | Sawik, T.; Schaller, A.; Tirpak, T. M., Scheduling of printed wiring board assembly in surface mount technology lines, J Electron Manuf, 11, 1, 1-17 (2002) |
| [142] | Sawik, T., An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers, Math Comput Model, 36, 4-5, 461-471 (2002) · Zbl 1052.90038 |
| [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, 234-244 (1995) · Zbl 0827.90070 |
| [144] | Nawaz, M.; Enscore, E. E.; Ham, I., A heuristic algorithm for the \(m\)-machine, \(n\)-job flow-shop sequencing problem, Omega, 11, 1, 91-95 (1983) |
| [145] | Campbell, H. G.; Dudek, R. A.; Smith, M. L., An heuristic algorithm for the \(n\) job \(m\) machine sequencing problem, Manage Sci, 16, 630-637 (1970) · Zbl 0194.50504 |
| [146] | Dannenbring, D. G., An evaluation of flow shop sequencing heuristics, Manage Sci, 23, 1, 1174-1182 (1977) · Zbl 0371.90063 |
| [147] | Gupta, J. N.D., A functional heuristic algorithm for the flow shop scheduling problem, Oper Res Q, 22, 1, 39-47 (1971) · Zbl 0216.26705 |
| [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, 101-107 (1965) |
| [149] | Ho, J. C., Flowshop sequencing with mean flowtime objective, Euro J Oper Res, 81, 3, 571-578 (1995) · Zbl 0912.90173 |
| [150] | Koulamas, C.; Kyparisis, G. J., Asymptotically optimal linear time algorithms for two-stage and three-stage flexible flow shops, Nav Res Logistics, 47, 3, 259-268 (2000) · Zbl 0956.90009 |
| [151] | Sriskandarajah, C.; Sethi, S. P., Scheduling algorithms for flexible flowshops: worst and average case performance, Eur J Oper Res, 43, 2, 143-160 (1989) · Zbl 0691.90038 |
| [152] | Yang, T.; Ignizio, J. P., An algorithm for the scheduling of army battalion training exercises, Comput Oper Res, 14, 6, 479-491 (1987) |
| [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.; 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.; Thole, M., Tabu search for the job-shop scheduling problem with multi-purpose machines, OR Spectr, 15, 4, 205-215 (1994) · Zbl 0798.90086 |
| [155] | Nowicki, E.; Smutnicki, C., A fast taboo search algorithm for the job shop problem, Manage Sci, 42, 6, 797-813 (1996) · Zbl 0880.90079 |
| [156] | Nowicki, E.; Smutnicki, C., A fast tabu search algorithm for the permutation flow-shop problem, Eur J Oper Res, 91, 1, 160-175 (1996) · Zbl 0947.90590 |
| [157] | Haouari, M.; M’Hallah, R., Heuristic algorithms for the two-stage hybrid flowshop problem, Oper Res Lett, 21, 1, 43-53 (1997) · Zbl 0885.90055 |
| [158] | Wardono, B.; Fathi, Y., A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities, Eur J Oper Res, 155, 2, 380-401 (2004) · Zbl 1045.90035 |
| [159] | Tang, L.; Xuan, H., Lagrangian relaxation algorithms for real-time hybrid flowshop scheduling with finite intermediate buffers, J Oper Res Soc, 57, 3, 316-324 (2006) · Zbl 1089.90029 |
| [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.; 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. · Zbl 1157.90429 |
| [161] | Narashimhan, S. L.; Mangiameli, P. M., A comparison of sequencing rules for a two stage hybrid flow shop, Decis Sci, 18, 2, 250-265 (1987) |
| [162] | Grangeon, N.; Tanguy, A.; Tchernev, N., Generic simulation model for hybrid flow-shop, Comput Ind Eng, 37, 1-2, 207-210 (1999) |
| [163] | Riane, F.; Artiba, A.; Iassinovski, S., An integrated production planning and scheduling system for hybrid flowshop organizations, Int J Prod Econ, 74, 1-3, 33-48 (2001) |
| [164] | Wong, W. K.; Chan, C. K.; Ip, W. H., A hybrid flowshop scheduling model for apparel manufacture, Int J Clothing Sci Technol, 13, 2, 115-131 (2001) |
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.
