Skip to main content
SpringerLink
Log in

A multi-start tabu search method for a single-machine scheduling problem with periodic maintenance and sequence-dependent set-up times

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

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.

    Article  Google Scholar 

  • Á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.

    Article  Google Scholar 

  • Á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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • Chen, W. (2009). Scheduling with dependent setups and maintenance in a textile company. Computers & Industrial Engineering, 57(3), 867–873.

    Article  Google Scholar 

  • 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.

    Google Scholar 

  • Duffua, A., Salih, O., Raouf, A., & Campbell, J. (1999). Planning and control of maintenance systems. Modeling and analysis. New York: Wiley.

    Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • Garg, A., & Deshmukh, S. G. (2006). Maintenance management: literature review and directions. Journal of Quality in Maintenance Engineering, 12(3), 205–238.

    Article  Google Scholar 

  • Glover, F. (1977). Heuristics for integer programming using surrogate constraints. Decision Sciences, 8(1), 156–166.

    Article  Google Scholar 

  • 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.

    Google Scholar 

  • Glover, F., & Laguna, M. (1997). Tabu search. Dordrecht: Kluwer Academic Publishers.

    Book  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • Hwang, H. C., & Chang, S. Y. (1998). Parallel machines scheduling with machine shutdown. Computers & Mathematics with Applications, 36(3), 21–31.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • Lee, C. Y., & Liman, S. D. (1992). Single machine flow-time scheduling with scheduled maintenance. Acta Informatica, 29(4), 375–382.

    Article  Google Scholar 

  • Liao, C. J., & Chen, W. J. (2003). Single-machine scheduling with periodic maintenance and non resumable jobs. Computers & Operations Research, 30(9), 1335–1347.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • Martí, R. (2002). Multi-start methods. In F. Glover & G. A. Kochenberger (Eds.), Handbook of metaheuristics (pp. 255–368). Dordrecht: Kluwer Academic Publishers.

    Google Scholar 

  • Miller, C. E., Tucker, A. W., & Zemlin, A. R. (1960). Integer programming formulations and traveling salesman problems. Journal of the ACM, 7, 326–329.

    Article  Google Scholar 

  • Monma, C. L., & Potts, C. N. (1989). On the complexity of scheduling with batch setup times. Operations Research, 37(5), 798–804.

    Article  Google Scholar 

  • Mosheiov, G., & Sarig, A. (2009). Scheduling a maintenance activity to minimize total weighted completion-time. Computers & Mathematics with Applications, 57(4), 619–623.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • Schmidt, G. (2000). Scheduling with limited machine availability. European Journal of Operational Research, 121(1), 1–15.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

Download references

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

  1. Universidad de Burgos, Plaza Infanta Doña Elena s/n, Burgos, 09001, Spain

    Joaquín Pacheco

  2. Instituto Tecnológico de Estudios Superiores de Monterrey, Campus Monterrey, Ave. Eugenio Garza Sada 2501, Colonia Tecnológico, Monterrey, Nuevo León, México

    Francisco Ángel-Bello

  3. Universidad Autónoma de Nuevo León, Ave. Universidad s/n, Ciudad Universitaria, San Nicolás de los Garza, Nuevo León, México

    Ada Álvarez

Authors
  1. Joaquín Pacheco
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Francisco Ángel-Bello
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ada Álvarez
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ada Álvarez.

Rights and permissions

Reprints 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

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-012-0280-2

Keywords

Search

Navigation