Journal of Intelligent Manufacturing

, Volume 24, Issue 4, pp 741–754 | Cite as

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

  • Miguel A. González
  • Camino R. Vela
  • Inés González-Rodríguez
  • Ramiro Varela
Article

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.

Keywords

Scheduling Tabu search Setup times Lateness minimization Computational experiments 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Supplementary material

10845_2011_622_MOESM1_ESM.pdf (113 kb)
ESM 1 (PDF 114 kb)

References

  1. 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–1032CrossRefGoogle Scholar
  2. 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–114CrossRefGoogle Scholar
  3. 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–159CrossRefGoogle Scholar
  4. 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–52CrossRefGoogle Scholar
  5. Balas E., Lancia G. (1998) Job shop scheduling with deadlines. Journal of Combinatorial Optimization 1: 329–353CrossRefGoogle Scholar
  6. Balas E., Simonetti N., Vazacopoulos A. (2008) Job shop scheduling with setup times, deadlines and precedence constraints. Journal of Scheduling 11: 253–262CrossRefGoogle Scholar
  7. 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.
  8. 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–414CrossRefGoogle Scholar
  9. 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–161CrossRefGoogle Scholar
  10. DeBontridder K. (2005) Minimizing total weighted tardiness in a generalized job shop. Journal of Scheduling 8: 479–496CrossRefGoogle Scholar
  11. Dell’ Amico M., Trubian M. (1993) Applying Tabu search to the job-shop scheduling problem. Annals of Operations Research 41: 231–252CrossRefGoogle Scholar
  12. 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.
  13. Glover F. (1989) Tabu search–part I. ORSA Journal on Computing 1(3): 190–206CrossRefGoogle Scholar
  14. 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.Google Scholar
  15. 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).Google Scholar
  16. 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–73CrossRefGoogle Scholar
  17. 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.Google Scholar
  18. 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–326CrossRefGoogle Scholar
  19. Hao J., Dorne R., Galinier P. (1998) Tabu search for frequency assignment in mobile radio networks. Journal of Heuristics 4(1): 47–62CrossRefGoogle Scholar
  20. 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.
  21. 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.Google Scholar
  22. 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.
  23. Mehta S., Uzsoy R. (1998) Predictable scheduling of a job shop subject to breakdowns. IEEE Transactions on Robotics and Automation 14(3): 365–378CrossRefGoogle Scholar
  24. Nowicki E., Smutnicki C. (1996) A fast taboo search algorithm for the job shop scheduling problem. Management Science 42: 797–813CrossRefGoogle Scholar
  25. Nowicki E., Smutnicki C. (2005) An advanced tabu search algorithm for the job shop problem. Journal of Scheduling 8: 145–159CrossRefGoogle Scholar
  26. 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).Google Scholar
  27. Ovacik I., Uzsoy R. (1994) Exploiting shop floor status information to schedule complex job shops. Journal of Manufacturing Systems 13(2): 73–84CrossRefGoogle Scholar
  28. Pinedo M. (2008) Scheduling. Theory, Algorithms, and Systems. Springer, BerlinGoogle Scholar
  29. Serifoglu F., Ulusoy G. (1999) Parallel machine scheduling with earliness and tardiness penalties. Computers and Operations Research 26: 773–787CrossRefGoogle Scholar
  30. 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–119CrossRefGoogle Scholar
  31. 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–16CrossRefGoogle Scholar
  32. Taillard E. (1993) Parallel taboo search techniques for the job shop scheduling problem. ORSA Journal on Computing 6: 108–117CrossRefGoogle Scholar
  33. 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–2033CrossRefGoogle Scholar
  34. Van Laarhoven P., Aarts E., Lenstra K. (1992) Job shop scheduling by simulated annealing. Operations Research 40: 113–125CrossRefGoogle Scholar
  35. 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–165CrossRefGoogle Scholar
  36. 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–2644CrossRefGoogle Scholar
  37. Wilbrecht J., Prescott W. (1969) The influence of setup times on job shop performance. Management Science 16(4): 391–401CrossRefGoogle Scholar
  38. 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–725CrossRefGoogle Scholar
  39. 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.
  40. 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–294CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2012

Authors and Affiliations

  • Miguel A. González
    • 1
  • Camino R. Vela
    • 1
  • Inés González-Rodríguez
    • 2
  • Ramiro Varela
    • 1
  1. 1.Department of Computing, Computing Technologies Group, Artificial Intelligence CenterUniversity of OviedoGijónSpain
  2. 2.Department of Mathematics, Statistics and ComputingUniversity of CantabriaSantanderSpain

Personalised recommendations