Skip to main content
SpringerLink
Log in

Lateness minimization with Tabu search for job shop scheduling problem with sequence dependent setup times

  • Published:
Journal of Intelligent Manufacturing Aims and scope Submit manuscript

Abstract

We tackle the job shop scheduling problem with sequence dependent setup times and maximum lateness minimization by means of a tabu search algorithm. We start by defining a disjunctive model for this problem, which allows us to study some properties of the problem. Using these properties we define a new local search neighborhood structure, which is then incorporated into the proposed tabu search algorithm. To assess the performance of this algorithm, we present the results of an extensive experimental study, including an analysis of the tabu search algorithm under different running conditions and a comparison with the state-of-the-art algorithms. The experiments are performed across two sets of conventional benchmarks with 960 and 17 instances respectively. The results demonstrate that the proposed tabu search algorithm is superior to the state-of-the-art methods both in quality and stability. In particular, our algorithm establishes new best solutions for 817 of the 960 instances of the first set and reaches the best known solutions in 16 of the 17 instances of the second set.

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

Similar content being viewed by others

References

  • Allahverdi A., Ng C., Cheng T., Kovalyov M. (2008) A survey of scheduling problems with setup times or costs. European Journal of Operational Research 187: 985–1032

    Article  Google Scholar 

  • Armentano V., Filho M. (2007) Minimizing total tardiness in parallel machine scheduling with setup times: An adaptive memory-based grasp approach. European Journal of Operational Research 183: 100–114

    Article  Google Scholar 

  • Artigues C., Feillet D. (2008) A branch and bound method for the job-shop problem with sequence-dependent setup times. Annals of Operations Research 159(1): 135–159

    Article  Google Scholar 

  • Artigues C., Lopez P., Ayache P. (2005) Schedule generation schemes for the job shop problem with sequence-dependent setup times: Dominance properties and computational analysis. Annals of Operations Research 138: 21–52

    Article  Google Scholar 

  • Balas E., Lancia G. (1998) Job shop scheduling with deadlines. Journal of Combinatorial Optimization 1: 329–353

    Article  Google Scholar 

  • Balas E., Simonetti N., Vazacopoulos A. (2008) Job shop scheduling with setup times, deadlines and precedence constraints. Journal of Scheduling 11: 253–262

    Article  Google Scholar 

  • Beck, J. C., Feng, T., & Watson, J. P. (2010). Combining constraint programming and local search for job-shop scheduling. Informs Journal on Computing. doi:10.1287/ijoc.1100.0388.

  • Bilge U., Kiraç F., Kurtulan M., PekgÂÿn P. (2004) A Tabu search algorithm for parallel machine total tardiness problem. Computers and Operations Research 31: 397–414

    Article  Google Scholar 

  • Brucker P., Thiele O. (1996) A branch and bound method for the general-job shop problem with sequence-dependent setup times. Operations Research Spektrum 18: 145–161

    Article  Google Scholar 

  • DeBontridder K. (2005) Minimizing total weighted tardiness in a generalized job shop. Journal of Scheduling 8: 479–496

    Article  Google Scholar 

  • Dell’ Amico M., Trubian M. (1993) Applying Tabu search to the job-shop scheduling problem. Annals of Operations Research 41: 231–252

    Article  Google Scholar 

  • Fleszar, K., Charalambous, C., & Hindi, K. S. (2011). A variable neighborhood descent heuristic for the problem of makespan minimisation on unrelated parallel machines with setup times. Journal of Intelligent Manufacturing. doi:10.1007/s10845-011-0522-8.

  • Glover F. (1989) Tabu search–part I. ORSA Journal on Computing 1(3): 190–206

    Article  Google Scholar 

  • González, M. A., Vela, C., & Varela, R. (2008). A new hybrid genetic algorithm for the job shop scheduling problem with setup times. In Proceedings of the 18th International Conference on Automated Planning and Scheduling (ICAPS-2008) (pp. 116–123). Sidney: AAAI Press.

  • González, M. A., Vela, C. R., & Varela, R. (2009). A Tabu search algorithm to minimize lateness in scheduling problems with setup times. In Proceedings of CAEPIA 2009 (pp. 115–124).

  • González Rodríguez I., Vela C. R., Puente J. (2010) A genetic solution based on lexicographical goal programming for a multiobjective job shop with uncertainty. Journal of Intelligent Manufacturing 21(1): 65–73

    Article  Google Scholar 

  • Grabowski, J., & Wodecki, M. (2005). A very fast Tabu search algorithm for job shop problem. In Metaheuristic optimization via memory and evolution. Operations research/computer science interfaces series, Vol. 30, pp. 117–144.

  • Graham R., Lawler E., Lenstra J., Rinnooy Kan A. (1979) Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics 5: 287–326

    Article  Google Scholar 

  • Hao J., Dorne R., Galinier P. (1998) Tabu search for frequency assignment in mobile radio networks. Journal of Heuristics 4(1): 47–62

    Article  Google Scholar 

  • Huang, J., Suer, G., & Urs, S. (2011). Genetic algorithm for rotary machine scheduling with dependent processing times. Journal of Intelligent Manufacturing. doi:10.1007/s10845-011-0521-9.

  • Matsuo, H., Suh, C., & Sullivan, R. (1988). A controlled search simulated annealing method for the general jobshop scheduling problem. Working paper 03-44-88, Graduate School of Business, University of Texas.

  • Meeran, S., & Morshed, M. (2011). A hybrid genetic tabu search algorithm for solving job shop scheduling problems: A case study. Journal of Intelligent Manufacturing. doi:10.1007/s10845-011-0520-x.

  • Mehta S., Uzsoy R. (1998) Predictable scheduling of a job shop subject to breakdowns. IEEE Transactions on Robotics and Automation 14(3): 365–378

    Article  Google Scholar 

  • Nowicki E., Smutnicki C. (1996) A fast taboo search algorithm for the job shop scheduling problem. Management Science 42: 797–813

    Article  Google Scholar 

  • Nowicki E., Smutnicki C. (2005) An advanced tabu search algorithm for the job shop problem. Journal of Scheduling 8: 145–159

    Article  Google Scholar 

  • Oddi, A., Rasconi, R., Cesta, A., & Smith, S. (2009). Iterative-sampling search for job shop scheduling with setup times. In COPLAS 2009 Proceedings of the Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems (pp. 27–33).

  • Ovacik I., Uzsoy R. (1994) Exploiting shop floor status information to schedule complex job shops. Journal of Manufacturing Systems 13(2): 73–84

    Article  Google Scholar 

  • Pinedo M. (2008) Scheduling. Theory, Algorithms, and Systems. Springer, Berlin

    Google Scholar 

  • Serifoglu F., Ulusoy G. (1999) Parallel machine scheduling with earliness and tardiness penalties. Computers and Operations Research 26: 773–787

    Article  Google Scholar 

  • Sierra M., Varela R. (2010) Best-first search and pruning by dominance for the job shop scheduling problem with total flow time. Journal of Intelligent Manufacturing 21(1): 111–119

    Article  Google Scholar 

  • Stecco G., Cordeau J. F. (2009) A Tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine. Journal of Scheduling 12: 3–16

    Article  Google Scholar 

  • Taillard E. (1993) Parallel taboo search techniques for the job shop scheduling problem. ORSA Journal on Computing 6: 108–117

    Article  Google Scholar 

  • Uzsoy R., Velásquez J. (2008) Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up times. Computers and Operations Research 35: 2018–2033

    Article  Google Scholar 

  • Van Laarhoven P., Aarts E., Lenstra K. (1992) Job shop scheduling by simulated annealing. Operations Research 40: 113–125

    Article  Google Scholar 

  • Vela C. R., Varela R., González M. A. (2010) Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times. Journal of Heuristics 16: 139–165

    Article  Google Scholar 

  • Watson J., Howe A., Whitley L. (2006) Deconstructing Nowicki and Smutnicki’s i-TSAB tabu search algorithm for the job-shop scheduling problem. Computers and Operations Research 33: 2623–2644

    Article  Google Scholar 

  • Wilbrecht J., Prescott W. (1969) The influence of setup times on job shop performance. Management Science 16(4): 391–401

    Article  Google Scholar 

  • Yan H., Xia Q., Zhu M., Liu X., Guo Z. (2003) Integrated production planning and scheduling on automobile assembly lines. IIE Transactions 35(8): 711–725

    Article  Google Scholar 

  • Ying, K. C., Lee, Z. J., & Lin, S. W. (2011). Makespan minimization for scheduling unrelated parallel machines with setup times. Journal of Intelligent Manufacturing. doi:10.1007/s10845-010-0483-3.

  • Zhang C., Li P., Rao Y., Guan Z. (2008) A very fast TS/SA algorithm for the job shop scheduling problem. Computers and Operations Research 35: 282–294

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing, Computing Technologies Group, Artificial Intelligence Center, University of Oviedo, Campus de Viesques, 33271, Gijón, Spain

    Miguel A. González, Camino R. Vela & Ramiro Varela

  2. Department of Mathematics, Statistics and Computing, University of Cantabria, Los Castros s/n, 39005, Santander, Spain

    Inés González-Rodríguez

Authors
  1. Miguel A. González
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Camino R. Vela
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Inés González-Rodríguez
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ramiro Varela
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Camino R. Vela.

Additional information

A preliminary version of the tabu search method was presented at the 13th Conference of the Spanish Association for Artificial Intelligence, CAEPIA2009, held in Seville, Spain, in 2009 (González et al. 2009).

Electronic Supplementary Material

The Below is the Electronic Supplementary Material.

ESM 1 (PDF 114 kb)

Rights and permissions

Reprints and permissions

About this article

Cite this article

González, M.A., Vela, C.R., González-Rodríguez, I. et al. Lateness minimization with Tabu search for job shop scheduling problem with sequence dependent setup times. J Intell Manuf 24, 741–754 (2013). https://doi.org/10.1007/s10845-011-0622-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10845-011-0622-5

Keywords

Search

Navigation