{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T18:39:44Z","timestamp":1775068784496,"version":"3.50.1"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,11,15]],"date-time":"2018-11-15T00:00:00Z","timestamp":1542240000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100008530","name":"European Regional Development Fund","doi-asserted-by":"publisher","award":["EFRE-0800463"],"award-info":[{"award-number":["EFRE-0800463"]}],"id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1007\/s00291-018-0537-z","type":"journal-article","created":{"date-parts":[[2018,11,15]],"date-time":"2018-11-15T02:42:22Z","timestamp":1542249742000},"page":"179-217","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":57,"title":["A worker constrained flexible job shop scheduling problem with sequence-dependent setup times"],"prefix":"10.1007","volume":"41","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7574-7588","authenticated-orcid":false,"given":"Dominik","family":"Kress","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"M\u00fcller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jenny","family":"Nossack","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,11,15]]},"reference":[{"issue":"2","key":"537_CR1","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.ejor.2015.04.004","volume":"246","author":"A Allahverdi","year":"2015","unstructured":"Allahverdi A (2015) The third comprehensive survey on scheduling problems with setup times\/costs. Eur J Oper Res 246(2):345\u2013378","journal-title":"Eur J Oper Res"},{"issue":"3","key":"537_CR2","doi-asserted-by":"publisher","first-page":"978","DOI":"10.1016\/j.ejor.2006.09.010","volume":"187","author":"A Allahverdi","year":"2008","unstructured":"Allahverdi A, Soroush HM (2008) The significance of reducing setup times\/setup costs. Eur J Oper Res 187(3):978\u2013984","journal-title":"Eur J Oper Res"},{"issue":"2","key":"537_CR3","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/S0305-0483(98)00042-5","volume":"27","author":"A Allahverdi","year":"1999","unstructured":"Allahverdi A, Gupta JND, Aldowaisan T (1999) A review of scheduling research involving setup considerations. Omega 27(2):219\u2013239","journal-title":"Omega"},{"issue":"3","key":"537_CR4","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1016\/j.ejor.2006.06.060","volume":"187","author":"A Allahverdi","year":"2008","unstructured":"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\u20131032","journal-title":"Eur J Oper Res"},{"issue":"1","key":"537_CR5","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/j.jmsy.2011.02.004","volume":"30","author":"A Bagheri","year":"2011","unstructured":"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\u201315","journal-title":"J Manuf Syst"},{"issue":"4","key":"537_CR6","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s10951-008-0067-7","volume":"11","author":"E Balas","year":"2008","unstructured":"Balas E, Simonetti N, Vazacopoulos A (2008) Job shop scheduling with setup times, deadlines and precedence constraints. J Sched 11(4):253\u2013262","journal-title":"J Sched"},{"issue":"1\u20134","key":"537_CR7","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s00170-014-5960-y","volume":"74","author":"J Behnamian","year":"2014","unstructured":"Behnamian J (2014) Scheduling and worker assignment problems on hybrid flowshop with cost-related objective function. Int J Adv Manuf Technol 74(1\u20134):267\u2013283","journal-title":"Int J Adv Manuf Technol"},{"issue":"4","key":"537_CR8","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1016\/j.disopt.2008.04.001","volume":"5","author":"LP Bigras","year":"2008","unstructured":"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\u2013699","journal-title":"Discrete Optim"},{"issue":"1","key":"537_CR9","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0166-218X(83)90012-4","volume":"5","author":"J B\u0142a\u017cewicz","year":"1983","unstructured":"B\u0142a\u017cewicz J, Lenstra JK, Rinnooy Kan AHG (1983) Scheduling subject to resource constraints: classification and complexity. Discrete Appl Math 5(1):11\u201324","journal-title":"Discrete Appl Math"},{"key":"537_CR10","volume-title":"Handbook on scheduling: from theory to applications","author":"J B\u0142a\u017cewicz","year":"2007","unstructured":"B\u0142a\u017cewicz J, Ecker KH, Pesch E, Schmidt G, W\u0119glarz J (2007) Handbook on scheduling: from theory to applications. Springer, Berlin"},{"key":"537_CR11","unstructured":"Boost (2018) The boost graph library (BGL). \n                    https:\/\/www.boost.org\/doc\/libs\/1_67_0\/libs\/graph\/doc\/index.html\n                    \n                  . Last accessed 22 June 2018"},{"issue":"4","key":"537_CR12","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/BF02238804","volume":"45","author":"P Brucker","year":"1990","unstructured":"Brucker P, Schlie R (1990) Job-shop scheduling with multi-purpose machines. Computing 45(4):369\u2013375","journal-title":"Computing"},{"issue":"10","key":"537_CR13","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1080\/07408170309342349","volume":"35","author":"D Chen","year":"2003","unstructured":"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\u2013985","journal-title":"IIE Trans"},{"issue":"1","key":"537_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2014.10.038","volume":"243","author":"P Bruecker De","year":"2015","unstructured":"De Bruecker P, Van den Bergh J, Beli\u00ebn J, Demeulemeester E (2015) Workforce planning incorporating skills: state of the art. Eur J Oper Res 243(1):1\u201316","journal-title":"Eur J Oper Res"},{"issue":"1\u20134","key":"537_CR15","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s00170-009-2388-x","volume":"49","author":"FM Defersha","year":"2010","unstructured":"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\u20134):263\u2013279","journal-title":"Int J Adv Manuf Technol"},{"issue":"1","key":"537_CR16","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s10479-011-0928-x","volume":"213","author":"F Della Croce","year":"2014","unstructured":"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\u201378","journal-title":"Ann Oper Res"},{"issue":"4","key":"537_CR17","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1287\/opre.8.4.487","volume":"8","author":"B Giffler","year":"1960","unstructured":"Giffler B, Thompson GL (1960) Algorithms for solving production-scheduling problems. Oper Res 8(4):487\u2013503","journal-title":"Oper Res"},{"key":"537_CR18","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"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\u2013326","journal-title":"Ann Discrete Math"},{"issue":"3","key":"537_CR19","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s00291-007-0078-3","volume":"29","author":"HO G\u00fcnther","year":"2007","unstructured":"G\u00fcnther HO, Lee TE (2007) Scheduling and control of automated manufacturing systems. OR Spectrum 29(3):373\u2013374","journal-title":"OR Spectrum"},{"issue":"1","key":"537_CR20","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF01721162","volume":"11","author":"R Haupt","year":"1989","unstructured":"Haupt R (1989) A survey of priority rule-based scheduling. OR Spektrum 11(1):3\u201316","journal-title":"OR Spektrum"},{"issue":"1","key":"537_CR21","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10107-003-0375-9","volume":"96","author":"JN Hooker","year":"2003","unstructured":"Hooker JN, Ottosson G (2003) Logic-based Benders decomposition. Math Program 96(1):33\u201360","journal-title":"Math Program"},{"issue":"4","key":"537_CR22","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/BF01719451","volume":"15","author":"J Hurink","year":"1994","unstructured":"Hurink J, Jurisch B, Thole M (1994) Tabu search for the job-shop scheduling problem with multi-purpose machines. OR Spektrum 15(4):205\u2013215","journal-title":"OR Spektrum"},{"key":"537_CR23","unstructured":"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\u201911. IEEE, pp 1375\u20131378"},{"issue":"9","key":"537_CR24","doi-asserted-by":"publisher","first-page":"2519","DOI":"10.1080\/00207543.2013.849822","volume":"52","author":"D Lei","year":"2014","unstructured":"Lei D, Guo X (2014) Variable neighbourhood search for dual-resource constrained flexible job shop scheduling. Int J Prod Res 52(9):2519\u20132529","journal-title":"Int J Prod Res"},{"key":"537_CR25","doi-asserted-by":"crossref","unstructured":"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\u201916. IEEE, pp 4921\u20134926","DOI":"10.1109\/CCDC.2016.7531874"},{"key":"537_CR26","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0167-5060(08)70821-5","volume":"4","author":"JK Lenstra","year":"1979","unstructured":"Lenstra JK, Rinnooy Kan AHG (1979) Computational complexity of discrete optimization problems. Ann Discrete Math 4:121\u2013140","journal-title":"Ann Discrete Math"},{"key":"537_CR27","unstructured":"Lowerre BT (1976) The HARPY speech recognition system. PhD thesis, Carnegie-Mellon University, Pittsburgh"},{"issue":"1","key":"537_CR28","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1002\/(SICI)1099-1425(200001\/02)3:1<3::AID-JOS32>3.0.CO;2-Y","volume":"3","author":"M Mastrolilli","year":"2000","unstructured":"Mastrolilli M, Gambardella LM (2000) Effective neighbourhood functions for the flexible job shop problem. J Sched 3(1):3\u201320","journal-title":"J Sched"},{"issue":"12","key":"537_CR29","doi-asserted-by":"publisher","first-page":"3476","DOI":"10.1080\/00207543.2012.746480","volume":"51","author":"M Mousakhani","year":"2013","unstructured":"Mousakhani M (2013) Sequence-dependent setup time flexible job shop scheduling problem to minimise total tardiness. Int J Prod Res 51(12):3476\u20133487","journal-title":"Int J Prod Res"},{"issue":"41\u201344","key":"537_CR30","first-page":"2117","volume":"6","author":"S Nourali","year":"2012","unstructured":"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\u201344):2117\u20132132","journal-title":"Int J Math Anal"},{"issue":"2","key":"537_CR31","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1016\/j.apm.2011.07.037","volume":"36","author":"C \u00d6zg\u00fcven","year":"2012","unstructured":"\u00d6zg\u00fcven C, Yavuz Y, \u00d6zbak\u0131r 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\u2013858","journal-title":"Appl Math Model"},{"key":"537_CR32","doi-asserted-by":"crossref","unstructured":"Paksi ABN, Ma\u2019ruf 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 012060","DOI":"10.1088\/1757-899X\/114\/1\/012060"},{"key":"537_CR33","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/j.ijpe.2014.03.006","volume":"153","author":"A Rossi","year":"2014","unstructured":"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\u2013267","journal-title":"Int J Prod Econ"},{"issue":"5\u20136","key":"537_CR34","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s00170-005-0375-4","volume":"32","author":"M Saidi-Mehrabad","year":"2007","unstructured":"Saidi-Mehrabad M, Fattahi P (2007) Flexible job shop scheduling with tabu search algorithms. Int J Adv Manuf Technol 32(5\u20136):563\u2013570","journal-title":"Int J Adv Manuf Technol"},{"issue":"15","key":"537_CR35","doi-asserted-by":"publisher","first-page":"4255","DOI":"10.1080\/00207543.2011.611539","volume":"50","author":"V Sels","year":"2012","unstructured":"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\u20134270","journal-title":"Int J Prod Res"},{"issue":"2","key":"537_CR36","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/j.ejor.2017.08.021","volume":"265","author":"L Shen","year":"2017","unstructured":"Shen L, Dauz\u00e8re-P\u00e9r\u00e8s S, Neufeld JS (2017) Solving the flexible job shop scheduling problem with sequence-dependent setup times. Eur J Oper Res 265(2):503\u2013516","journal-title":"Eur J Oper Res"},{"key":"537_CR37","unstructured":"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\u201912. ACM, pp 774\u2013779"},{"issue":"3","key":"537_CR38","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1080\/07408178908966233","volume":"21","author":"M Treleven","year":"1989","unstructured":"Treleven M (1989) A review of the dual resource constrained system research. IIE Trans 21(3):279\u2013287","journal-title":"IIE Trans"},{"issue":"2","key":"537_CR39","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1016\/j.ejor.2009.05.038","volume":"202","author":"L Venditti","year":"2010","unstructured":"Venditti L, Pacciarelli D, Meloni C (2010) A tabu search algorithm for scheduling pharmaceutical packaging operations. Eur J Oper Res 202(2):538\u2013546","journal-title":"Eur J Oper Res"},{"issue":"2","key":"537_CR40","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1016\/j.ejor.2007.06.039","volume":"190","author":"G Vilcot","year":"2008","unstructured":"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\u2013411","journal-title":"Eur J Oper Res"},{"issue":"2","key":"537_CR41","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/j.ejor.2011.03.004","volume":"215","author":"J Xu","year":"2011","unstructured":"Xu J, Xu X, Xie SQ (2011) Recent developments in dual resource constrained (DRC) system research. Eur J Oper Res 215(2):309\u2013318","journal-title":"Eur J Oper Res"},{"issue":"3","key":"537_CR42","first-page":"1242","volume":"22","author":"M Yazdani","year":"2015","unstructured":"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\u20131257","journal-title":"Sci Iran Trans E"},{"key":"537_CR43","doi-asserted-by":"crossref","unstructured":"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\u2013908","DOI":"10.4028\/www.scientific.net\/AMR.430-432.905"},{"issue":"8","key":"537_CR44","doi-asserted-by":"publisher","first-page":"1961","DOI":"10.1007\/s10845-015-1082-0","volume":"28","author":"J Zhang","year":"2015","unstructured":"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\u20131972","journal-title":"J Intell Manuf"},{"issue":"18","key":"537_CR45","doi-asserted-by":"publisher","first-page":"5554","DOI":"10.1080\/00207543.2016.1170226","volume":"54","author":"XL Zheng","year":"2016","unstructured":"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\u20135566","journal-title":"Int J Prod Res"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-018-0537-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00291-018-0537-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-018-0537-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,23]],"date-time":"2019-12-23T04:30:01Z","timestamp":1577075401000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00291-018-0537-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,15]]},"references-count":45,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,3]]}},"alternative-id":["537"],"URL":"https:\/\/doi.org\/10.1007\/s00291-018-0537-z","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,11,15]]},"assertion":[{"value":"14 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 October 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 November 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}