Abstract
This paper investigates flexible flow line problems with sequence dependent setup times and different preventive maintenance policies. The optimization criterion is the minimization of makespan. The contribution of this work could be divided into two parts: (1) Since the proposed integrating methods in the literature are often not only complicated but also problem-specific, we have been thinking of providing a technique simple to implement, yet easily extendible to any other machine scheduling problems to overcome the foregoing drawbacks. (2) In order to tackle the problem, we propose a novel variable neighborhood search (VNS) as well as the adaptations of some existing high performing metaheuristics in the literature. The proposed VNS uses advanced neighborhood search structures. In order to evaluate the algorithms, a benchmark is established with the meticulous care. All the results illustrate that the VNS outperforms the other algorithms.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aggoune R. (2004) Minimizing the makespan for the flow shop scheduling problem with availability constraints. European Journal of Operational Research 153: 534–543 doi:10.1016/S0377-2217(03)00261-3
Allahverdi A. (1995) Two-stage production scheduling with separated setup times and stochastic breakdowns. The Journal of the Operational Research Society 46: 896–904
Allahverdi A. (1997) Scheduling in stochastic flowshops with independent setup, processing and removal times. Computers & Operations Research 24: 955–960 doi:10.1016/S0305-0548(97)00006-3
Allahverdi A., Ng C.T., Cheng T.C.E., Kovalyov Y.M. (2008) A survey of scheduling problems with setup times or costs. European Journal of Operational Research 187(3): 985–1032 doi:10.1016/j.ejor.2006.06.060
Allaoui H., Artiba A. (2004) Integrating simulation and optimization to schedule a hybrid flowshop with maintenance constraints. Computers & Industrial Engineering 47: 431–450 doi:10.1016/j.cie.2004.09.002
Allaoui H., Artiba A. (2006) Scheduling two-stage hybrid flow shop with availability constraints. Computers & Operations Research 33: 1399–1419 doi:10.1016/j.cor.2004.09.034
Blazewicz J., Breit J., Formanowicz P., Kubiak W., Schmidt G. (2001) Heuristic algorithms for the two-machine flowshop problem with limited machine availability. Omega, 29: 599–608 doi:10.1016/S0305-0483(01)00048-2
Breit J. (2006) A polynomial-time approximation scheme for the two-machine flowshop scheduling problem with an availability constraint. Computers & Operations Research 33: 2143–2153 doi:10.1016/j.cor.2005.01.004
Cassady C.R., Kutanoglu E. (2003) Minimizing job tardiness using integrated preventive maintenance planning and production scheduling. IIE Transactions 35(6): 503–513 doi:10.1080/07408170304416
Flesza K., Hindi K.S. (2004) Solving the resource-constrained project scheduling problem by a variable neighborhood search. European Journal of Operational Research 155: 402–413 doi:10.1016/S0377-2217(02)00884-6
Gao J., Sun L., Gen M. (2008) A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems. Computers & Operations Research 35(9): 2892–2907 doi:10.1016/j.cor.2007.01.001
Graves, G. H., & Lee, C. Y. (1999). Scheduling maintenance and semiresumable jobs on a single machine. Naval Research Logistics, 46, 845–863. doi:10.1002/(SICI)1520-6750(199910)46:7<845::AID-NAV6>3.0.CO;2-#.
Gupta J.N.D., Darrow W.P. (1986) The two-machine sequence dependent flow shop scheduling problem. European Journal of Operational Research 24(3): 439–446 doi:10.1016/0377-2217(86)90037-8
Johnson S.M. (1954) Optimal two and three-stage production schedules with setup times included. Naval Research Logistics Quarterly 1: 61–67 doi:10.1002/nav.3800010110
Kurz M.E., Askin R.G. (2003) Comparing scheduling rules for flexible flow lines. International Journal of Production Economics 85: 371–388 doi:10.1016/S0925-5273(03)00123-3
Kurz M.E., Askin R.G. (2004) Scheduling flexible flow lines with sequence-dependent setup times. European Journal of Operational Research 159(1): 66–82 doi:10.1016/S0377-2217(03)00401-6
Lee C.Y. (1997) Minimizing the makespan in the two-machine flow-shop scheduling problem with an availability constraint. Operations Research Letters 20: 129–139 doi:10.1016/S0167-6377(96)00041-7
Lee C.Y. (1999) Two-machine flowshop scheduling with availability constraints. European Journal of Operational Research 114: 420–429 doi:10.1016/S0377-2217(97)00452-9
Lee, C. Y., & Chen, Z. L. (2000). Scheduling jobs and maintenance activities on parallel machines. Naval Research Logistics, 47, 145–165. doi:10.1002/(SICI)1520-6750(200003)47:2<145::AID-NAV5>3.0.CO;2-3.
Leung J.Y.T. (2004) Handbook of scheduling: Algorithms, models, and performance analysis. Chapman & Hall, USA
Liao C.J., Cheng C.C. (2007) A variable neighborhood search for minimizing single machine weighted earliness and tardiness with common due date. Computers & Industrial Engineering 52: 404–413 doi:10.1016/j.cie.2007.01.004
McCall J.J. (1965) Maintenance policies for stochastically failing equipment: A survey. Management Science 11: 493–524
Nawaz M., Enscore E.E. Jr., Ham I. (1983) A heuristic algorithm for the m-machine, n-job flowshop sequencing problem. OMEGA, The International Journal of Management Science 11(1): 91–95
Osman I., Potts C. (1989) Simulated annealing for permutation flowshop scheduling. OMEGA, the International Journal of Management Science 17(6): 551–557
Pierskalla W.P., Voelker J.A. (1976) A survey of maintenance models: The control and surveillance of deteriorating systems. Naval Logistics Research Quarterly 23: 353–388 doi:10.1002/nav.3800230302
Qi X., Chen T., Tu F. (1999) Scheduling the maintenance on a single machine. The Journal of the Operational Research Society 50: 1071–1078
Ruiz R., García-Díaz J.C., Maroto C. (2007) Considering scheduling and preventive maintenance in the flowshop sequencing problem. Computers & Operations Research 34: 3314–3330 doi:10.1016/j.cor.2005.12.007
Ruiz R., Maroto C. (2006) A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility. European Journal of Operational Research 169: 781–800 doi:10.1016/j.ejor.2004.06.038
Ruiz R., Stützle T. (2008) An Iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives. European Journal of Operational Research 187(3): 1143–1159 doi:10.1016/j.ejor.2006.07.029
Schmidt G. (2000) Scheduling with limited machine availability. European Journal of Operational Research 121: 1–15 doi:10.1016/S0377-2217(98)00367-1
Sherif Y.S., Smith M.L. (1976) Optimal maintenance models for systems subject to failure—a review. Naval Logistics Research Quarterly 23: 47–74
Sortrakul N., Nachtmann H.L., Cassady C.R. (2005) Genetic algorithms for integrated preventive maintenance planning and production scheduling for a single machine. Computers in Industry 56: 161–168 doi:10.1016/j.compind.2004.06.005
Yanga D.L., Hsub C.J., Kuoc W.H. (2008) A two-machine flowshop scheduling problem with a separated maintenance constraint. Computers & Operations Research 35(3): 876–883 doi:10.1016/j.cor.2006.04.007
Yoshida T., Hitomi K. (1979) Optimal two-stage production with setup times separated. AIIE Transactions 11: 261–263
Zandieh M., Fatemi Ghomi S.M.T., Moattar Husseini S.M. (2006) An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times. Journal of Applied Mathematics and Computation 180: 111–127 doi:10.1016/j.amc.2005.11.136
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Naderi, B., Zandieh, M. & Fatemi Ghomi, S.M.T. A study on integrating sequence dependent setup time flexible flow lines and preventive maintenance scheduling. J Intell Manuf 20, 683–694 (2009). https://doi.org/10.1007/s10845-008-0157-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10845-008-0157-6