{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T15:32:11Z","timestamp":1769268731647,"version":"3.49.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,7,10]],"date-time":"2018-07-10T00:00:00Z","timestamp":1531180800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,7,10]],"date-time":"2018-07-10T00:00:00Z","timestamp":1531180800000},"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,12]]},"DOI":"10.1007\/s12351-018-0414-1","type":"journal-article","created":{"date-parts":[[2018,7,10]],"date-time":"2018-07-10T10:16:50Z","timestamp":1531217810000},"page":"2333-2363","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["A new exact algorithm for no-wait job shop problem to minimize makespan"],"prefix":"10.1007","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6550-5291","authenticated-orcid":false,"given":"A.","family":"Ozolins","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,10]]},"reference":[{"issue":"2","key":"414_CR1","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1287\/ijoc.3.2.149","volume":"3","author":"D Applegate","year":"1991","unstructured":"Applegate D, Cook W (1991) A computational study of the job-shop scheduling problem. ORSA J Comput 3(2):149\u2013156","journal-title":"ORSA J Comput"},{"issue":"4","key":"414_CR2","doi-asserted-by":"publisher","first-page":"1502","DOI":"10.1016\/j.cie.2008.09.023","volume":"56","author":"W Bozejko","year":"2009","unstructured":"Bozejko W, Makuchowski M (2009) A fast hybrid tabu search algorithm for the no-wait job shop problem. Comput Ind Eng 56(4):1502\u20131509","journal-title":"Comput Ind Eng"},{"issue":"2","key":"414_CR3","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/s10878-012-9466-y","volume":"26","author":"R B\u00fcrgy","year":"2013","unstructured":"B\u00fcrgy R, Gr\u00f6flin H (2013) Optimal job insertion in the no-wait job shop. J Combin Optim 26(2):345\u2013371","journal-title":"J Combin Optim"},{"issue":"2","key":"414_CR4","doi-asserted-by":"publisher","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":"2","key":"414_CR5","first-page":"225","volume":"3","author":"H Fisher","year":"1963","unstructured":"Fisher H, Thompson G (1963) Probabilistic learning combinations of local job-shop scheduling rules. Ind Sched 3(2):225\u2013251","journal-title":"Ind Sched"},{"issue":"5","key":"414_CR6","doi-asserted-by":"publisher","first-page":"1200","DOI":"10.1016\/j.cor.2004.09.009","volume":"33","author":"JM Framinan","year":"2006","unstructured":"Framinan JM, Schuster C (2006) An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach. Comput Oper Res 33(5):1200\u20131213","journal-title":"Comput Oper Res"},{"issue":"12","key":"414_CR7","doi-asserted-by":"publisher","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. Comp Oper Res 39(12):2968\u20132977","journal-title":"Comp Oper Res"},{"key":"414_CR8","volume-title":"Supplement to resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques","author":"S Lawrence","year":"1984","unstructured":"Lawrence S (1984) Supplement to resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques. Carnegie Mellon University, Pittsburgh"},{"key":"414_CR9","unstructured":"Lennartz P (2006) No-wait job shop scheduling, a constraint propagation approach. PhD thesis, Utrecht University"},{"key":"414_CR10","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0167-5060(08)70821-5","volume":"4","author":"J Lenstra","year":"1979","unstructured":"Lenstra J, Rinnooy Kan A (1979) Computational complexity of discrete optimization problems. Ann Discrete Math 4:121\u2013140","journal-title":"Ann Discrete Math"},{"issue":"5\u20138","key":"414_CR11","doi-asserted-by":"publisher","first-page":"1401","DOI":"10.1007\/s00170-013-4866-4","volume":"87","author":"X Li","year":"2016","unstructured":"Li X, Xu H, Li M (2016) A memory-based complete local search method with variable neighborhood structures for no-wait job shops. Int J Adv Manuf Technol 87(5\u20138):1401\u20131408","journal-title":"Int J Adv Manuf Technol"},{"issue":"3","key":"414_CR12","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1016\/S0377-2217(01)00338-1","volume":"143","author":"A Mascis","year":"2002","unstructured":"Mascis A, Pacciarelli D (2002) Job-shop scheduling with blocking and no-wait constraints. Eur J Oper Res 143(3):498\u2013517","journal-title":"Eur J Oper Res"},{"key":"414_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/s10100-017-0488-5","author":"A Ozolins","year":"2017","unstructured":"Ozolins A (2017) Improved bounded dynamic programming algorithm for solving the blocking flow shop problem. Central Eur J Oper Res. \n                  https:\/\/doi.org\/10.1007\/s10100-017-0488-5","journal-title":"Central Eur J Oper Res"},{"key":"414_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/s12351-018-0381-6","author":"A Ozolins","year":"2018","unstructured":"Ozolins A (2018) Bounded dynamic programming algorithm for the job shop problem with sequence dependent setup times. Oper Res Int J. \n                  https:\/\/doi.org\/10.1007\/s12351-018-0381-6","journal-title":"Oper Res Int J"},{"issue":"4","key":"414_CR15","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1287\/moor.4.4.448","volume":"4","author":"S Sahni","year":"1979","unstructured":"Sahni S, Cho Y (1979) Complexity of scheduling shops with no wait in process. Math Oper Res 4(4):448\u2013457","journal-title":"Math Oper Res"},{"issue":"3","key":"414_CR16","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/s00186-005-0056-y","volume":"63","author":"C Schuster","year":"2006","unstructured":"Schuster C (2006) No-wait job shop scheduling: tabu search and complexity of subproblems. Math Methods Oper Res 63(3):473\u2013491","journal-title":"Math Methods Oper Res"},{"issue":"10","key":"414_CR17","doi-asserted-by":"publisher","first-page":"1495","DOI":"10.1287\/mnsc.38.10.1495","volume":"38","author":"R Storer","year":"1992","unstructured":"Storer R, Wu S, Vaccari R (1992) New search spaces for sequencing problems with application to job shop scheduling. Manag Sci 38(10):1495\u20131509","journal-title":"Manag Sci"},{"key":"414_CR18","first-page":"1","volume":"21","author":"S Sundar","year":"2016","unstructured":"Sundar S, Suganthan P, Jin C, Xiang C, Soon C (2016) A hybrid artificial bee colony algorithm for the job-shop scheduling problem with no-wait constraint. Soft Comput 21:1\u201310","journal-title":"Soft Comput"},{"key":"414_CR19","unstructured":"van\u00a0den Broek J (2009) Mip-based approaches for complex planning problems. Ph.D. thesis, Eindhoven University of Technology"},{"key":"414_CR20","unstructured":"van Hoorn J (2016) Dynamic programming for routing and scheduling: optimizing sequences of decisions. Ph.D. thesis, VU University Amsterdam"},{"issue":"1","key":"414_CR21","first-page":"189","volume":"9","author":"J Zhu","year":"2012","unstructured":"Zhu J, Li X (2012) An effective meta-heuristic for no-wait job shops to minimize makespan. IEEE Trans Autom Sci Eng 9(1):189\u2013198","journal-title":"IEEE Trans Autom Sci Eng"},{"issue":"2","key":"414_CR22","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1016\/j.ejor.2008.09.015","volume":"198","author":"J Zhu","year":"2009","unstructured":"Zhu J, Li X, Wang Q (2009) Complete local search with limited memory algorithm for no-wait job shops to minimize makespan. Eur J Oper Res 198(2):378\u2013386","journal-title":"Eur J Oper Res"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-018-0414-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12351-018-0414-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-018-0414-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,10]],"date-time":"2020-10-10T05:05:16Z","timestamp":1602306316000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12351-018-0414-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,10]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["414"],"URL":"https:\/\/doi.org\/10.1007\/s12351-018-0414-1","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,7,10]]},"assertion":[{"value":"3 January 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 May 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 July 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 July 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}