Abstract
In this paper we study a problem of sequencing jobs in a machine with programmed preventive maintenance and sequence-dependent set-up times. The problem combines two NP-hard problems, so we propose a heuristic method for solving it, which hybridizes multi-start strategies with Tabu Search. We compare our method with the only published metaheuristic algorithm for this problem on a set of 420 instances. The comparison favors the method developed in this work, showing that is able to find high quality solutions in very short computational times.
Similar content being viewed by others
References
Allahverdi, A., Ng, C. T., Cheng, T. C. E., & Kovalyov, M. Y. (2008). A survey of scheduling problems with setup times or costs. European Journal of Operational Research, 187(3), 985–1032.
Ángel-Bello, F., Álvarez, A., Pacheco, J., & Martínez, I. (2011a). A single machine scheduling problem with availability constraints and sequence-dependent setup costs. Applied Mathematical Modelling, 35(4), 2041–2050.
Ángel-Bello, F., Álvarez, A., Pacheco, J., & Martínez, I. (2011b). A heuristic approach for a scheduling problem with periodic maintenance and sequence-dependent setup times. Computers & Mathematics with Applications, 61(4), 797–808.
Armentano, V. A., & Mazzini, R. (2000). A genetic algorithm for scheduling on a single machine with set-up times and due dates. Production Planning & Control, 11(7), 713–720.
Chen, J. S. (2008a). Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan. European Journal of Operational Research, 190(1), 90–102.
Chen, W. (2008b). Sequencing heuristic for scheduling jobs with dependent setups in a manufacturing system. The International Journal of Advanced Manufacturing Technology, 38(1–2), 176–184.
Chen, W. (2009). Scheduling with dependent setups and maintenance in a textile company. Computers & Industrial Engineering, 57(3), 867–873.
Das, S. R., Gupta, J. N. D., & Khumawala, B. M. (1995). A saving index heuristic algorithm for flowshop scheduling with sequence dependent set-up times. Journal of the Operational Research Society, 46(11), 365–373.
Duffua, A., Salih, O., Raouf, A., & Campbell, J. (1999). Planning and control of maintenance systems. Modeling and analysis. New York: Wiley.
França, P. M., Mendes, A., & Moscato, P. (2001). A memetic algorithm for the total tardiness single machine scheduling problem. European Journal of Operational Research, 132(1), 224–242.
Gagne, C., Price, W. L., & Gravel, M. (2002). Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times. Journal of the Operational Research Society, 53(8), 895–906.
Garg, A., & Deshmukh, S. G. (2006). Maintenance management: literature review and directions. Journal of Quality in Maintenance Engineering, 12(3), 205–238.
Glover, F. (1977). Heuristics for integer programming using surrogate constraints. Decision Sciences, 8(1), 156–166.
Glover, F. (1996). Tabu search and adaptive memory programming. Advances, applications and challenges. In R. Barr, R. Helgason, & J. Kennington (Eds.), Interfaces in computer science and operations research (pp. 1–75). Dordrecht: Kluwer Academic Publishers.
Glover, F., & Laguna, M. (1997). Tabu search. Dordrecht: Kluwer Academic Publishers.
Gravel, M., Price, W. L., & Gagné, C. (2000). Scheduling jobs in an Alcan aluminum factory using a genetic algorithm. International Journal of Production Research, 38(13), 3031–3041.
Gupta, S., & Smith, J. (2006). Algorithms for single machine total tardiness scheduling with sequence dependent setups. European Journal of Operational Research, 175(2), 722–739.
Hwang, H. C., & Chang, S. Y. (1998). Parallel machines scheduling with machine shutdown. Computers & Mathematics with Applications, 36(3), 21–31.
Hwang, H. C., Lee, K., & Chang, S. Y. (2005). The effect of machine availability on the worst-case performance of LPT. Discrete Applied Mathematics, 148(1), 49–61.
Ji, M., He, Y., & Cheng, T. C. E. (2007). Single-machine scheduling with periodic maintenance to minimize makespan. Computers & Operations Research, 34(6), 1764–1770.
Lee, C. Y., & Liman, S. D. (1992). Single machine flow-time scheduling with scheduled maintenance. Acta Informatica, 29(4), 375–382.
Liao, C. J., & Chen, W. J. (2003). Single-machine scheduling with periodic maintenance and non resumable jobs. Computers & Operations Research, 30(9), 1335–1347.
Low, Ch., Hsu, C.-J., & Su, C.-T. (2008). Minimizing the makespan with an availability constraint on a single machine under simple linear deterioration. Computers & Mathematics with Applications, 56(1), 257–265.
Martí, R. (2002). Multi-start methods. In F. Glover & G. A. Kochenberger (Eds.), Handbook of metaheuristics (pp. 255–368). Dordrecht: Kluwer Academic Publishers.
Miller, C. E., Tucker, A. W., & Zemlin, A. R. (1960). Integer programming formulations and traveling salesman problems. Journal of the ACM, 7, 326–329.
Monma, C. L., & Potts, C. N. (1989). On the complexity of scheduling with batch setup times. Operations Research, 37(5), 798–804.
Mosheiov, G., & Sarig, A. (2009). Scheduling a maintenance activity to minimize total weighted completion-time. Computers & Mathematics with Applications, 57(4), 619–623.
Sadfi, Ch., Penz, B., Rapine, C., Blazewicz, J., & Formanowicz, P. (2005). An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints. European Journal of Operational Research, 161(1), 3–10.
Schmidt, G. (2000). Scheduling with limited machine availability. European Journal of Operational Research, 121(1), 1–15.
Tan, K. C., & Narasimhan, R. (1997). Minimizing tardiness on a single processor with sequence-dependent setup times: a simulated annealing approach. Omega, 25(6), 619–634.
Tan, K. C., Narasimhan, R., Rubin, P. A., & Ragatz, G. L. (2000). A comparison of four methods for minimizing total tardiness on a single processor with sequence dependent setup times. Omega, 28(3), 313–326.
Acknowledgements
This work was partially supported by the Mexican National Council of Science and Technology (grant 61903); by the Spanish Ministry of Education and Science and FEDER founds (Project ECO2008-06159/ECON); by the Research Chair in Industrial Engineering of Tecnológico de Monterrey (ITESM Research Fund CAT128), and by the Regional Government of Castilla y León (Project BU008A10-2) and CajaBurgos. These supports are gratefully acknowledged.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Pacheco, J., Ángel-Bello, F. & Álvarez, A. A multi-start tabu search method for a single-machine scheduling problem with periodic maintenance and sequence-dependent set-up times. J Sched 16, 661–673 (2013). https://doi.org/10.1007/s10951-012-0280-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10951-012-0280-2