Abstract
The focus of this paper is on the treatment of a reentrant and flexible flow shop problem in which the processing times of the jobs at some stage may depend on the decisions made for the jobs at stages before and after the current stage, that is, they may depend on the machine sequence the jobs take in the processing flow. The problem was encountered in a cutting stock application embedded in the context of a virtual organisation. A mathematical model capturing the issues of reentrancy and machine sequence dependency is given. Solution procedures using a mixed-integer programming (MIP) solver and two metaheuristics, simulated annealing and tabu search are presented. The feasibility of the approach is established by computational tests with 30 randomly generated problem instances. The optimal results were obtained for all instances up to ten clients and five service providers and one instance with 15 clients and five service providers. The rest of the results were within the limits provided by the MIP solver.
Article PDF
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
References
Ahonen H, Alvarenga AG, Amaral ARS (2014) Simulated annealing and tabu search approaches for the corridor allocation problem. Eur J Oper Res 232:221–33
Ahonen H, Alvarenga AG, Provedel A (2009) Selection and scheduling in a virtual organisation environment with a service broker. Comput Indust Eng 57:1353–62
Ahonen H, Alvarenga AG, Provedel A, Parada V (2001) A client-broker-server architecture of a virtual enterprise for cutting stock applications. Int J Comput Integr Manuf 14(2):194–205
Allahverdi A, Ng CT, Cheng TCE, Kovalyov MY (2008) A survey of scheduling problems with setup times or costs. Eur J Oper Res 187:985–1032
Bertel S, Billaut J-C (2004) A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation. Eur J Oper Res 159:651–62
Bispo CF, Tayur S (2001) Managing simple re-entrant flow lines: theoretical foundation and experimental results. IIE Trans 33:609–23
Bozorgirad MA, Logendran R (2013) Bi-criteria group scheduling in hybrid flowshops. Int J Prod Econ 145:599–612
Chen J-S, Pan JC-H, Lin C-M (2008) A hybrid genetic algorithm for the re-entrant flow-shop scheduling problem. Expert Syst Appl 34:570–7
Chen J-S, Pan JC-H, Wu C-K (2007) Minimizing makespan in reentrant flow-shops using hybrid tabu search. Int J Adv Manuf Technol 34:353–61
Chiang T-C (2013) Enhancing rule-based scheduling in wafer fabrication facilities by evolutionary algorithms: review and opportunity. Comput Indust Eng 64:524–35
Choi H-S, Kim J-S, Lee D-H (2011) Real-time scheduling for reentrant hybrid flow shops: a decision tree based mechanism and its application to a TFT-LCD line. Expert Syst Appl 38:3514–21
Choi S-W, Kim Y-D (2008) Minimizing makespan on an m-machine re-entrant flowshop. Comput Oper Res 35:1684–96
Costa A, Cappadonna FA, Fichera S (2013) A dual encoding-based meta-heuristic algorithm for solving a constrained hybrid flow shop scheduling problem. Comput Indust Eng 64:937–58
Demirkol E, Uzsoy R (2000) Decomposition methods for the reentrant flow shops with sequence-dependent setup times. J Sched 3(3):155–77
Dudewicz EJ, Mishra SN (1988) Modern mathematical statistics, Wiley series in probability and mathematical statistics. Wiley, Singapore
Dugardin F, Yalaoui F, Amodeo L (2010) New multi-objective method to solve reentrant hybrid flow shop scheduling problem. Eur J Oper Res 203:22–31
Glover F, Laguna M (1997) Tabu search. Kluwer Academic Publishers, Dordrecht/London
Gupta AK, Sivakumar AI (2006) Job shop scheduling techniques in semiconductor manufacturing. Int J Adv Manuf Technol 27:1163–69
Gupta JND (1988) Two-stage, hybrid flowshop scheduling problem. J Oper Res Soc 39(4):359–64
Jing C, Huang W, Tang G (2011) Minimizing total completion time for re-entrant flow shop scheduling problems. Theor Comput Sci 412:6712–19
Joo BJ, Choi YC, Xirouchakis P (2013) Dispatching rule-based algorithms for a dynamic flexible flow shop scheduling problem with time-dependent process defect rate and quality feedback. Proced CIRP 7:163–8
Kang Y-H, Kim S-S, Shin HJ (2007) A scheduling algorithm for the reentrant shop: an application in semiconductor manufacture. Int J Adv Manuf Technol 35(5/6):566–74
Kis T, Pesch E (2005) A review of exact solution methods for the non-preemptive multiprocessor flowshop problem. Eur J Oper Res 164:592–608
Laarhoven PJM, Aarts EHL (eds) (1987) Simulated annealing: theory and applications. Kluwer Academic Publishers, MA, USA
Lee G-C (2014) Real time order flowtime estimation methods for two-stage hybrid flowshops. Omega 42:1–8
Li J-Q, Pan Q-k, Wang F-T (2014) A hybrid variable neighborhood search for solving the hybrid flow shop scheduling problem. Appl Soft Comput 24:63–77
Lin D, Lee CKM (2011) A review of the research methodology for the re-entrant scheduling problem. Int J Prod Res 49(8):2221–42
Linn R, Zhang W (1999) Hybrid flow shop scheduling: a survey. Comput Indust Eng 37:57–61
Middendorf M, Timkovsky VG (2002) On scheduling cycle shops: classification, complexity and approximation. J Sched 5(2):135–69
Naderi B, Ruiz R, Zandieh M (2010) Algorithms for a realistic variant of flowshop scheduling. Comput Oper Res 37:236–46
Naderi B, Zandieh M, Roshanaei V (2009) Scheduling hybrid flowshops with sequence dependent setup times to minimize makespan and maximum tardiness. Int J Adv Manuf Technol 41:1186–98
Pan Q-K, Wang L, Li J-Q, Duan J-H (2014) A novel discrete artificial bee colony algorithm for the hybrid flowshop scheduling problem with makespan minimisation. Omega 45:42–56
Quadt D, Kuhn H (2007) A taxonomy of flexible flow line scheduling procedures. Eur J Oper Res 178:686–98
Ribas I, Leisten R, Framiñan JM (2010) Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective. Comput Oper Res 37:1439–54
Ruiz R, Şerifoğlu FS, Urlings T (2008) Modeling realistic hybrid flexible flowshop scheduling problems. Comput Oper Res 35:1151–75
Ruiz R, Maroto C (2006) A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility. Eur J Oper Res 169:781–800
Ruiz R, Vázquez-Rodríguez JA (2010) The hybrid flow shop scheduling problem. Eur J Oper Res 205:1–18
Steiner G, Xue Z (2005) Scheduling in reentrant robotic cells: algorithms and complexity. J Sched 8:25–48
Wang H (2005) Flexible flow shop scheduling: optimum, heuristics and artificial intelligence solutions. Expert Syst 22(2):78–85
Wang S, Lin M (2013) A genetic algorithm for two-stage no-wait hybrid flow shop scheduling problem. Comput Oper Res 40:1064–75
Weng W, Wei X, Fujimura S (2012) Dynamic routing strategies for JIT production in hybrid flow shops. Comput Oper Res 39:3316–24
Zare HK, Fakhrzad MB (2011) Solving flexible flow-shop problem with a hybrid genetic algorithm and data mining: a fuzzy approach. Expert Syst Appl 38:7609–15
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ahonen, H., de Alvarenga, A.G. Scheduling flexible flow shop with recirculation and machine sequence-dependent processing times: formulation and solution procedures. Int J Adv Manuf Technol 89, 765–777 (2017). https://doi.org/10.1007/s00170-016-9093-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-016-9093-3