{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T18:40:20Z","timestamp":1775068820134,"version":"3.50.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,2,3]],"date-time":"2018-02-03T00:00:00Z","timestamp":1517616000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,2,3]],"date-time":"2018-02-03T00:00:00Z","timestamp":1517616000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s12351-018-0381-6","type":"journal-article","created":{"date-parts":[[2018,2,3]],"date-time":"2018-02-03T14:30:25Z","timestamp":1517668225000},"page":"1701-1728","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Bounded dynamic programming algorithm for the job shop problem with sequence dependent setup times"],"prefix":"10.1007","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6550-5291","authenticated-orcid":false,"given":"Ansis","family":"Ozolins","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,2,3]]},"reference":[{"issue":"3","key":"381_CR1","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/mnsc.34.3.391","volume":"34","author":"J Adams","year":"1988","unstructured":"Adams J, Balas E, Zawack D (1988) The shifting bottleneck procedure for job shop scheduling. Manag Sci 34(3):391\u2013401","journal-title":"Manag Sci"},{"issue":"1","key":"381_CR2","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/s10479-007-0283-0","volume":"159","author":"C Artigues","year":"2008","unstructured":"Artigues C, Feillet D (2008) A branch and bound method for the job-shop problem with sequence-dependent setup times. Ann Oper Res 159(1):135\u2013159","journal-title":"Ann Oper Res"},{"key":"381_CR3","doi-asserted-by":"crossref","unstructured":"Artigues C, Belmokhtar S, Feillet D (2004) A new exact solution algorithm for the job shop problem with sequence-dependent setup times. In: International conference on integration of artificial intelligence (AI) and operations research (OR) techniques in constraint programming. Springer, Berlin, pp 37\u201349","DOI":"10.1007\/978-3-540-24664-0_3"},{"issue":"4","key":"381_CR4","doi-asserted-by":"crossref","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":"3","key":"381_CR5","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF01539706","volume":"18","author":"P Brucker","year":"1996","unstructured":"Brucker P, Thiele O (1996) A branch and bound method for the general-shop problem with sequence dependent setup-times. Oper Res Spektrum 18(3):145\u2013161","journal-title":"Oper Res Spektrum"},{"issue":"1","key":"381_CR6","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0166-218X(94)90204-6","volume":"49","author":"P Brucker","year":"1994","unstructured":"Brucker P, Jurisch B, Sievers B (1994) A branch and bound algorithm for the job-shop scheduling problem. Discrete Appl Math 49(1):107\u2013127","journal-title":"Discrete Appl Math"},{"issue":"1","key":"381_CR7","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/S0377-2217(82)80007-6","volume":"11","author":"J Carlier","year":"1982","unstructured":"Carlier J (1982) The one-machine sequencing problem. Eur J Oper Res 11(1):42\u201347","journal-title":"Eur J Oper Res"},{"issue":"2","key":"381_CR8","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1287\/mnsc.35.2.164","volume":"35","author":"J Carlier","year":"1989","unstructured":"Carlier J, Pinson \u00c9 (1989) An algorithm for solving the job-shop problem. Manag Sci 35(2):164\u2013176","journal-title":"Manag Sci"},{"issue":"1\u20134","key":"381_CR9","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1023\/A:1014990729837","volume":"107","author":"W Cheung","year":"2001","unstructured":"Cheung W, Zhou H (2001) Using genetic algorithms and heuristics for job shop scheduling with sequence-dependent setup times. Ann Oper Res 107(1\u20134):65\u201381","journal-title":"Ann Oper Res"},{"issue":"4","key":"381_CR10","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/j.disopt.2010.04.002","volume":"7","author":"RF Da Silva","year":"2010","unstructured":"Da Silva RF, Urrutia S (2010) A general VNS heuristic for the traveling salesman problem with time windows. Discrete Optim 7(4):203\u2013211","journal-title":"Discrete Optim"},{"issue":"1","key":"381_CR11","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0305-0548(93)E0015-L","volume":"22","author":"F Della Croce","year":"1995","unstructured":"Della Croce F, Tadei R, Volta G (1995) A genetic algorithm for the job shop problem. Comput Oper Res 22(1):15\u201324","journal-title":"Comput Oper Res"},{"issue":"3","key":"381_CR12","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1002\/net.20033","volume":"44","author":"D Feillet","year":"2004","unstructured":"Feillet D, Dejax P, Gendreau M, Gueguen C (2004) An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems. Networks 44(3):216\u2013229","journal-title":"Networks"},{"key":"381_CR13","first-page":"225","volume":"3","author":"H Fisher","year":"1963","unstructured":"Fisher H, Thompson GL (1963) Probabilistic learning combinations of local job-shop scheduling rules. Ind Sched 3:225\u2013251","journal-title":"Ind Sched"},{"issue":"2","key":"381_CR14","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1111\/itor.12044","volume":"21","author":"JF Gon\u00e7alves","year":"2014","unstructured":"Gon\u00e7alves JF, Resende MG (2014) An extended Akers graphical method with a biased random-key genetic algorithm for job-shop scheduling. Int Trans Oper Res 21(2):215\u2013246","journal-title":"Int Trans Oper Res"},{"key":"381_CR15","unstructured":"Gonz\u00e1lez MA, Vela CR, Varela R (2008) A new hybrid genetic algorithm for the job shop scheduling problem with setup times. In: ICAPS, pp 116\u2013123"},{"key":"381_CR16","doi-asserted-by":"crossref","unstructured":"Gonz\u00e1lez MA, Vela CR, Varela R (2009) Genetic algorithm combined with tabu search for the job shop scheduling problem with setup times. In: International work-conference on the interplay between natural and artificial computation. Springer, Berlin, pp 265\u2013274","DOI":"10.1007\/978-3-642-02264-7_28"},{"key":"381_CR17","doi-asserted-by":"crossref","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, Kan AR (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5:287\u2013326","journal-title":"Ann Discrete Math"},{"key":"381_CR18","doi-asserted-by":"crossref","unstructured":"Grimes D, Hebrard E (2010) Job shop scheduling with setup times and maximal time-lags: a simple constraint programming approach. In: International conference on integration of artificial intelligence (AI) and operations research (OR) techniques in constraint programming. Springer, Berlin, pp 147\u2013161","DOI":"10.1007\/978-3-642-13520-0_19"},{"key":"381_CR19","doi-asserted-by":"crossref","unstructured":"Grimes D, Hebrard E, Malapert A (2009) Closing the open shop: contradicting conventional wisdom. In: International conference on principles and practice of constraint programming. Springer, Berlin, pp 400\u2013408","DOI":"10.1007\/978-3-642-04244-7_33"},{"issue":"12","key":"381_CR20","doi-asserted-by":"crossref","first-page":"2968","DOI":"10.1016\/j.cor.2012.02.024","volume":"39","author":"J Gromicho","year":"2012","unstructured":"Gromicho J, Van Hoorn J, Saldanha-da Gama F, Timmer G (2012) Solving the job-shop scheduling problem optimally by dynamic programming. Comput Oper Res 39(12):2968\u20132977","journal-title":"Comput Oper Res"},{"key":"381_CR21","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/j.cie.2015.07.015","volume":"88","author":"M Kurdi","year":"2015","unstructured":"Kurdi M (2015) A new hybrid island model genetic algorithm for job shop scheduling problem. Comput Indus Eng 88:273\u2013283","journal-title":"Comput Indus Eng"},{"key":"381_CR22","doi-asserted-by":"crossref","unstructured":"Martin P, Shmoys DB (1996) A new approach to computing optimal schedules for the job-shop scheduling problem. In: H.W. Cunningham, T.S. McCormick, M. Queyranne (eds.) International Conference on Integer Programming and Combinatorial Optimization. Springer, Berlin, pp 389\u2013403","DOI":"10.1007\/3-540-61310-2_29"},{"issue":"6","key":"381_CR23","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","volume":"42","author":"E Nowicki","year":"1996","unstructured":"Nowicki E, Smutnicki C (1996) A fast taboo search algorithm for the job shop problem. Manag Sci 42(6):797\u2013813","journal-title":"Manag Sci"},{"issue":"2","key":"381_CR24","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s10951-005-6364-5","volume":"8","author":"E Nowicki","year":"2005","unstructured":"Nowicki E, Smutnicki C (2005) An advanced tabu search algorithm for the job shop problem. J Sched 8(2):145\u2013159","journal-title":"J Sched"},{"key":"381_CR25","doi-asserted-by":"publisher","unstructured":"Ozolins A (2017) Improved bounded dynamic programming algorithm for solving the blocking flow shop problem. Cent Eur J Oper Res. \nhttps:\/\/doi.org\/10.1007\/s10100-017-0488-5","DOI":"10.1007\/s10100-017-0488-5"},{"key":"381_CR26","doi-asserted-by":"crossref","unstructured":"Papalitsas C, Giannakis K, Andronikos T, Theotokis D, Sifaleras A (2015) Initialization methods for the TSP with time windows using variable neighborhood search. In: 2015 6th international conference on information, intelligence, systems and applications (IISA). IEEE, Washington, pp 1\u20136","DOI":"10.1109\/IISA.2015.7388106"},{"key":"381_CR27","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/j.cor.2014.08.006","volume":"53","author":"B Peng","year":"2015","unstructured":"Peng B, L\u00fc Z, Cheng T (2015) A tabu search\/path relinking algorithm to solve the job shop scheduling problem. Comput Oper Res 53:154\u2013164","journal-title":"Comput Oper Res"},{"key":"381_CR28","unstructured":"van Hoorn JJ (2016) Dynamic programming for routing and scheduling: optimizing sequences of decisions\u00a0[Ph.D. thesis]. VU University Amsterdam"},{"key":"381_CR29","doi-asserted-by":"crossref","unstructured":"van Hoorn JJ, Nogueira A, Ojea I, Gromicho JA (2016) An corrigendum on the paper: solving the job-shop scheduling problem optimally by dynamic programming. Comput Oper Res 78:381","DOI":"10.1016\/j.cor.2016.09.001"},{"issue":"1","key":"381_CR30","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1016\/j.cor.2006.02.024","volume":"35","author":"CY Zhang","year":"2008","unstructured":"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(1):282\u2013294","journal-title":"Comput Oper Res"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12351-018-0381-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-018-0381-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-018-0381-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,27]],"date-time":"2020-07-27T18:27:51Z","timestamp":1595874471000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12351-018-0381-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,3]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["381"],"URL":"https:\/\/doi.org\/10.1007\/s12351-018-0381-6","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,2,3]]},"assertion":[{"value":"30 November 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 December 2017","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 January 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 February 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}