Soft Computing

, Volume 16, Issue 12, pp 2097–2113 | Cite as

An efficient hybrid evolutionary algorithm for scheduling with setup times and weighted tardiness minimization

  • Miguel Ángel González
  • Inés González-Rodríguez
  • Camino R. Vela
  • Ramiro Varela
Original Paper


We confront the job shop scheduling problem with sequence-dependent setup times and weighted tardiness minimization. To solve this problem, we propose a hybrid metaheuristic that combines the intensification capability of tabu search with the diversification capability of a genetic algorithm which plays the role of long term memory for tabu search in the combined approach. We define and analyze a new neighborhood structure for this problem which is embedded in the tabu search algorithm. The efficiency of the proposed algorithm relies on some elements such as neighbors filtering and a proper balance between intensification and diversification of the search. We report results from an experimental study across conventional benchmarks, where we analyze our approach and demonstrate that it compares favorably to the state-of-the-art methods.



This research has been supported by the Spanish Government under research grants FEDER TIN2010-20976-C02-02 and MTM2010-16051.


  1. Angel Bello F, Alvarez A, Pacheco J, Martinez I (2011a) A heuristic approach for a scheduling problem with periodic maintenance and sequence-dependent setup times. Comput Math Appl 61(4):797–808MathSciNetMATHCrossRefGoogle Scholar
  2. Angel Bello F, Alvarez A, Pacheco J, Martinez I (2011b) A single machine scheduling problem with availability constraints and sequence-dependent setup costs. Appl Math Model 35(4):2041–2050MathSciNetMATHCrossRefGoogle Scholar
  3. Applegate D, Cook W (1991) A computational study of the job-shop scheduling problem. ORSA J Comput 3:149–156MATHCrossRefGoogle Scholar
  4. Artigues C, Belmokhtar S, Feillet D (2004) A new exact solution algorithm for the job shop problem with sequence-dependent setup times. In: Proceedings of CPAIOR 2004, vol 3011. Springer, LNCS, pp 37–49Google Scholar
  5. 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. Ann Operations Res 138:21–52MathSciNetMATHCrossRefGoogle Scholar
  6. Balas E, Vazacopoulos A (1998) Guided local search with shifting bottleneck fo job shop scheduling. Manag Sci 44(2):262–275MATHCrossRefGoogle Scholar
  7. Balas E, Simonetti N, Vazacopoulos A (2008) Job shop scheduling with setup times, deadlines and precedence constraints. J Sched 11:253–262MathSciNetMATHCrossRefGoogle Scholar
  8. Beck JC, Feng T, Watson JP (2011) Combining constraint programming and local search for job-shop scheduling. Inf J Comput 23:1–14. doi: 10.1287/ijoc.1100.0388 MathSciNetMATHCrossRefGoogle Scholar
  9. Behnamian J, Zandieh M, Fatemi Ghomi S (2011) Bi-objective parallel machines scheduling with sequence-dependent setup times using hybrid metaheuristics and weighted min-max technique. Soft Comput 15:1313–1331CrossRefGoogle Scholar
  10. Bierwirth C (1995) A generalized permutation approach to jobshop scheduling with genetic algorithms. OR Spectr 17:87–92MATHCrossRefGoogle Scholar
  11. Brucker P, Thiele O (1996) A branch and bound method for the general-job shop problem with sequence-dependent setup times. Operations Res Spektr 18:145–161MathSciNetMATHCrossRefGoogle Scholar
  12. Brucker P, Jurisch B, Sievers B (1994) A branch and bound algorithm for the job-shop scheduling problem. Discret Appl Math 49:107–127MathSciNetMATHCrossRefGoogle Scholar
  13. Bülbül K (2011) A hybrid shifting bottleneck-tabu serach heuristic for the job shop total weighted tardiness problem. Comput Operations Res 38:967–783MATHCrossRefGoogle Scholar
  14. Carlier J, Pinson E (1989) An algorithm for solving the job-shop problem. Manag Sci 35(2):164–176MathSciNetMATHCrossRefGoogle Scholar
  15. DeBontridder K (2005) Minimizing total weighted tardiness in a generalized job shop. J Sched 8:479–496MathSciNetCrossRefGoogle Scholar
  16. Dell’ Amico M, Trubian M (1993) Applying tabu search to the job-shop scheduling problem. Ann Oper Res 41:231–252MATHCrossRefGoogle Scholar
  17. Dorndorf U, Pesch E, Phan-Huy T (2000) Constraint propagation techniques for the disjunctive scheduling problem. Artif Intell 122:189–240MathSciNetMATHCrossRefGoogle Scholar
  18. Essafi I, Mati Y, Dauzère-Pérès S (2008) A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem. Comput Oper Res 35:2599–2616MathSciNetMATHCrossRefGoogle Scholar
  19. Gaciasa B, Artigues C, Lopeza P (2010) Parallel machine scheduling with precedence constraints and setup times. Comput Oper Res 37:2141–2151MathSciNetCrossRefGoogle Scholar
  20. Garcia S, Molina D, Lozano M, Herrera F (2009) A study on the use of non-parametric tests for analyzing the evolutionary algorithms’ behaviour: a case study on the CEC’2005 special session on real parameter optimization. J Heuristics 15:617–644MATHCrossRefGoogle Scholar
  21. Giffler B, Thompson GL (1960) Algorithms for solving production scheduling problems. Oper Res 8:487–503MathSciNetMATHCrossRefGoogle Scholar
  22. Glover F, Laguna M (1997) Tabu Search. Kluwer Academic Publishers, NorwellGoogle Scholar
  23. González MA, Vela CR, Varela R (2008) A new hybrid genetic algorithm for the job shop scheduling problem with setup times. In: Proceedings of ICAPS-2008. AAAI Press, Sidney, pp 116–123Google Scholar
  24. González MA, Vela CR, Varela R (2009) Genetic algorithm combined with tabu search for the job shop scheduling problem with setup times. In: Proceedings of IWINAC 2009, LNCS-5601, Springer, pp 265–274Google Scholar
  25. González MA, Vela CR, Varela R (2011) Weighted tardiness minimization in job shops with setup times by hybrid genetic algorithm. In: Proceedings of CAEPIA 2011. LNCS, Springer, La Laguna (Spain), pp 363–372Google Scholar
  26. González MA, Vela CR, González-Rodríguez I, Varela R (2012) Lateness minimization with tabu search for job shop scheduling problem with sequence dependent setup times. J Intell Manuf. doi: 10.1007/s10845-011-0622-5
  27. Graham R, Lawler E, Lenstra J, Rinnooy Kan A (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discret Math 4:287–326MathSciNetCrossRefGoogle Scholar
  28. IBM (2009) Modeling with IBM ILOG CP Optimizer—practical scheduling examples.
  29. Jat SN, Yang S (2011) A hybrid genetic algorithm and tabu search approach for post enrolment course timetabling. J Sched 14:617–637. doi: 10.1007/s10951-010-0202-0 MathSciNetCrossRefGoogle Scholar
  30. Kreipl S (2000) A large step random walk for minimizing total weighted tardiness in a job shop. J Sched 3:125–138MathSciNetMATHCrossRefGoogle Scholar
  31. Lawrence S (1984) Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques (supplement). Tech Rep, Graduate School of Industrial Administration, Carnegie Mellon UniversityGoogle Scholar
  32. Mahfoud SW (1992) Crowding and preselection revisited. In: Parallel Problem Solving From Nature. Elsevier, Amsterdam, pp 27–36Google Scholar
  33. Mati Y, Dauzere-Peres S, Lahlou C (2011) A general approach for optimizing regular criteria in the job-shop scheduling problem. Eur J Oper Res 212:33–42MathSciNetMATHCrossRefGoogle Scholar
  34. 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 TexasGoogle Scholar
  35. Nowicki E, Smutnicki C (1996) A fast taboo search algorithm for the job shop scheduling problem. Manag Sci 42:797–813MATHCrossRefGoogle Scholar
  36. Nowicki E, Smutnicki C (2005) An advanced tabu search algorithm for the job shop problem. J Sched 8:145–159MathSciNetMATHCrossRefGoogle Scholar
  37. Philippe Laborie P (2009) IBM ILOG CP Optimizer for detailed scheduling illustrated on three problems. In: Proceedings of CPAIOR09, pp 148–162Google Scholar
  38. Singer M, Pinedo M (1998) A computational study of branch and bound techniques for minimizing the total weighted tardiness in job shops. IIE Trans 30:109–118Google Scholar
  39. Singer M, Pinedo M (1999) A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop. Nav Res Logist 46(1):1–17MathSciNetMATHCrossRefGoogle Scholar
  40. Taillard ED (1994) Parallel taboo search techniques for the job shop scheduling problem. ORSA J Comput 6(2):108–117MATHCrossRefGoogle Scholar
  41. Tavakkoli-Moghaddam R, Khalili M, Naderi B (2009) A hybridization of simulated annealing and electromagnetic-like mechanism for job shop problems with machine availability and sequence-dependent setup times to minimize total weighted tardiness. Soft Comput 13:995–1006CrossRefGoogle Scholar
  42. Van Hentenryck P, Michel L (2004) Scheduling abstractions for local search. Lect Notes Comput Sci 3011:319–334CrossRefGoogle Scholar
  43. Van Laarhoven P, Aarts E, Lenstra K (1992) Job shop scheduling by simulated annealing. Oper Res 40:113–125MathSciNetMATHCrossRefGoogle Scholar
  44. Varela R, Serrano D, Sierra M (2005) New codification schemas for scheduling with genetic algorithms. Proceedings of IWINAC 2005, Lect Notes Comput Sci 3562:11–20Google Scholar
  45. Vela CR, Varela R, González MA (2010) Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times. J Heuristics 16:139–165MATHCrossRefGoogle Scholar
  46. Zhang CY, Li P, Rao Y, Guan Z (2008) A very fast TS/SA algorithm for the job shop scheduling problem. Comput Oper Res 35:282–294MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag 2012

Authors and Affiliations

  • Miguel Ángel González
    • 1
  • Inés González-Rodríguez
    • 2
  • Camino R. Vela
    • 1
  • Ramiro Varela
    • 1
  1. 1.Department of Computing, Artificial Intelligence Center, Computing Technologies GroupUniversity of OviedoGijónSpain
  2. 2.Department of Mathematics, Statistics and ComputingUniversity of CantabriaCantabriaSpain

Personalised recommendations