OR Spectrum

pp 1–39 | Cite as

A worker constrained flexible job shop scheduling problem with sequence-dependent setup times

  • Dominik Kress
  • David Müller
  • Jenny Nossack
Regular Article


We consider a flexible job shop scheduling problem with sequence-dependent setup times that incorporates heterogeneous machine operator qualifications by taking account of machine- and operator-dependent processing times. We analyze two objective functions, minimizing the makespan and minimizing the total tardiness, and present exact and heuristic decomposition-based solution approaches. These approaches divide the scheduling problem into a vehicle routing problem with precedence constraints and an operator assignment problem, and connect these problems via logic inequalities. We assess the quality of our solution methods in an extensive computational study that is based on randomly generated as well as real-world problem instances.


Scheduling Flexible job shop Decomposition Logic inequalities Vehicle routing 



This work has been supported by the European Union and the state North Rhine-Westphalia through the European Fund for Regional Development (EFRD). It has been conducted as part of the project “EKPLO: Echtzeitnahes kollaboratives Planen und Optimieren” (EFRE-0800463).

Supplementary material (3.3 mb)
Supplementary material 1 (zip 3398 KB)


  1. Allahverdi A (2015) The third comprehensive survey on scheduling problems with setup times/costs. Eur J Oper Res 246(2):345–378CrossRefGoogle Scholar
  2. Allahverdi A, Soroush HM (2008) The significance of reducing setup times/setup costs. Eur J Oper Res 187(3):978–984CrossRefGoogle Scholar
  3. Allahverdi A, Gupta JND, Aldowaisan T (1999) A review of scheduling research involving setup considerations. Omega 27(2):219–239CrossRefGoogle Scholar
  4. Allahverdi A, Ng CT, Cheng TCE, Kovalyov MY (2008) A survey of scheduling problems with setup times or costs. Eur J Oper Res 187(3):985–1032CrossRefGoogle Scholar
  5. Bagheri A, Zandieh M (2011) Bi-criteria flexible job-shop scheduling with sequence-dependent setup times-variable neighborhood search approach. J Manuf Syst 30(1):8–15CrossRefGoogle Scholar
  6. Balas E, Simonetti N, Vazacopoulos A (2008) Job shop scheduling with setup times, deadlines and precedence constraints. J Sched 11(4):253–262CrossRefGoogle Scholar
  7. Behnamian J (2014) Scheduling and worker assignment problems on hybrid flowshop with cost-related objective function. Int J Adv Manuf Technol 74(1–4):267–283CrossRefGoogle Scholar
  8. Bigras LP, Gamache M, Savard G (2008) The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times. Discrete Optim 5(4):685–699CrossRefGoogle Scholar
  9. Błażewicz J, Lenstra JK, Rinnooy Kan AHG (1983) Scheduling subject to resource constraints: classification and complexity. Discrete Appl Math 5(1):11–24CrossRefGoogle Scholar
  10. Błażewicz J, Ecker KH, Pesch E, Schmidt G, Węglarz J (2007) Handbook on scheduling: from theory to applications. Springer, BerlinGoogle Scholar
  11. Boost (2018) The boost graph library (BGL). Last accessed 22 June 2018
  12. Brucker P, Schlie R (1990) Job-shop scheduling with multi-purpose machines. Computing 45(4):369–375CrossRefGoogle Scholar
  13. Chen D, Luh PB, Thakur LS, Moreno J Jr (2003) Optimization-based manufacturing scheduling with multiple resources, setup requirements, and transfer lots. IIE Trans 35(10):973–985CrossRefGoogle Scholar
  14. De Bruecker P, Van den Bergh J, Beliën J, Demeulemeester E (2015) Workforce planning incorporating skills: state of the art. Eur J Oper Res 243(1):1–16CrossRefGoogle Scholar
  15. Defersha FM, Chen M (2010) A parallel genetic algorithm for a flexible job-shop scheduling problem with sequence dependent setups. Int J Adv Manuf Technol 49(1–4):263–279CrossRefGoogle Scholar
  16. Della Croce F, Grosso A, Salassa F (2014) A matheuristic approach for the two-machine total completion time flow shop problem. Ann Oper Res 213(1):67–78CrossRefGoogle Scholar
  17. Giffler B, Thompson GL (1960) Algorithms for solving production-scheduling problems. Oper Res 8(4):487–503CrossRefGoogle Scholar
  18. Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5:287–326CrossRefGoogle Scholar
  19. Günther HO, Lee TE (2007) Scheduling and control of automated manufacturing systems. OR Spectrum 29(3):373–374CrossRefGoogle Scholar
  20. Haupt R (1989) A survey of priority rule-based scheduling. OR Spektrum 11(1):3–16CrossRefGoogle Scholar
  21. Hooker JN, Ottosson G (2003) Logic-based Benders decomposition. Math Program 96(1):33–60CrossRefGoogle Scholar
  22. Hurink J, Jurisch B, Thole M (1994) Tabu search for the job-shop scheduling problem with multi-purpose machines. OR Spektrum 15(4):205–215CrossRefGoogle Scholar
  23. Lang M, Li H (2011) Research on dual-resource multi-objective flexible job shop scheduling under uncertainty. In: Proceedings of the 2nd international conference on artificial intelligence, management science and electronic commerce, AIMSEC’11. IEEE, pp 1375–1378Google Scholar
  24. Lei D, Guo X (2014) Variable neighbourhood search for dual-resource constrained flexible job shop scheduling. Int J Prod Res 52(9):2519–2529CrossRefGoogle Scholar
  25. Lei D, Tan X (2016) Local search with controlled deterioration for multi-objective scheduling in dual-resource constrained flexible job shop. In: Proceedings of the 28th Chinese control and decision conference, CCDC’16. IEEE, pp 4921–4926Google Scholar
  26. Lenstra JK, Rinnooy Kan AHG (1979) Computational complexity of discrete optimization problems. Ann Discrete Math 4:121–140CrossRefGoogle Scholar
  27. Lowerre BT (1976) The HARPY speech recognition system. PhD thesis, Carnegie-Mellon University, PittsburghGoogle Scholar
  28. Mastrolilli M, Gambardella LM (2000) Effective neighbourhood functions for the flexible job shop problem. J Sched 3(1):3–20CrossRefGoogle Scholar
  29. Mousakhani M (2013) Sequence-dependent setup time flexible job shop scheduling problem to minimise total tardiness. Int J Prod Res 51(12):3476–3487CrossRefGoogle Scholar
  30. Nourali S, Imanipour N, Shahriari MR (2012) A mathematical model for integrated process planning and scheduling in flexible assembly job shop environment with sequence dependent setup times. Int J Math Anal 6(41–44):2117–2132Google Scholar
  31. Özgüven C, Yavuz Y, Özbakır L (2012) Mixed integer goal programming models for the flexible job-shop scheduling problems with separable and non-separable sequence dependent setup times. Appl Math Model 36(2):846–858CrossRefGoogle Scholar
  32. Paksi ABN, Ma’ruf A (2016) Flexible job-shop scheduling with dual-resource constraints to minimize tardiness using genetic algorithm. In: Proceedings of the 2nd international manufacturing engineering conference and 3rd Asia-Pacific conference on manufacturing systems. IOP Publishing, p 012060Google Scholar
  33. Rossi A (2014) Flexible job shop scheduling with sequence-dependent setup and transportation times by ant colony with reinforced pheromone relationships. Int J Prod Econ 153:253–267CrossRefGoogle Scholar
  34. Saidi-Mehrabad M, Fattahi P (2007) Flexible job shop scheduling with tabu search algorithms. Int J Adv Manuf Technol 32(5–6):563–570CrossRefGoogle Scholar
  35. Sels V, Gheysen N, Vanhoucke M (2012) A comparison of priority rules for the job shop scheduling problem under different flow time-and tardiness-related objective functions. Int J Prod Res 50(15):4255–4270CrossRefGoogle Scholar
  36. Shen L, Dauzère-Pérès S, Neufeld JS (2017) Solving the flexible job shop scheduling problem with sequence-dependent setup times. Eur J Oper Res 265(2):503–516CrossRefGoogle Scholar
  37. Tran TT, Beck JC (2012) Logic-based Benders decomposition for alternative resource scheduling with sequence dependent setups. In: Proceedings of the 20th European conference on artificial intelligence, ECAI’12. ACM, pp 774–779Google Scholar
  38. Treleven M (1989) A review of the dual resource constrained system research. IIE Trans 21(3):279–287CrossRefGoogle Scholar
  39. Venditti L, Pacciarelli D, Meloni C (2010) A tabu search algorithm for scheduling pharmaceutical packaging operations. Eur J Oper Res 202(2):538–546CrossRefGoogle Scholar
  40. Vilcot G, Billaut JC (2008) A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem. Eur J Oper Res 190(2):398–411CrossRefGoogle Scholar
  41. Xu J, Xu X, Xie SQ (2011) Recent developments in dual resource constrained (DRC) system research. Eur J Oper Res 215(2):309–318CrossRefGoogle Scholar
  42. Yazdani M, Zandieh M, Tavakkoli-Moghaddam R, Jolai F (2015) Two meta-heuristic algorithms for the dual-resource constrained flexible job-shop scheduling problem. Sci Iran Trans E 22(3):1242–1257Google Scholar
  43. Zhang J, Liu GB (2012) Hybrid ant colony algorithm for job shop schedule with unrelated parallel machines. In: Proceedings of the conference on frontiers of advanced materials and engineering technology. Trans Tech Publications, pp 905–908Google Scholar
  44. Zhang J, Wang W, Xu X (2015) A hybrid discrete particle swarm optimization for dual-resource constrained job shop scheduling with resource flexibility. J Intell Manuf 28(8):1961–1972CrossRefGoogle Scholar
  45. Zheng XL, Wang L (2016) A knowledge-guided fruit fly optimization algorithm for dual resource constrained flexible job-shop scheduling problem. Int J Prod Res 54(18):5554–5566CrossRefGoogle Scholar

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Management Information ScienceUniversity of SiegenSiegenGermany
  2. 2.Center for Advanced Studies in ManagementHHL LeipzigLeipzigGermany

Personalised recommendations