{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:36:42Z","timestamp":1759847802797,"version":"3.37.3"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,5,10]],"date-time":"2016-05-10T00:00:00Z","timestamp":1462838400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001711","name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","doi-asserted-by":"publisher","award":["P2FRP2_161720"],"award-info":[{"award-number":["P2FRP2_161720"]}],"id":[{"id":"10.13039\/501100001711","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1007\/s10878-016-0020-1","type":"journal-article","created":{"date-parts":[[2016,5,10]],"date-time":"2016-05-10T11:01:32Z","timestamp":1462878092000},"page":"977-1010","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["The no-wait job shop with regular objective: a method based on optimal job insertion"],"prefix":"10.1007","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0349-4275","authenticated-orcid":false,"given":"Reinhard","family":"B\u00fcrgy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heinz","family":"Gr\u00f6flin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,5,10]]},"reference":[{"key":"20_CR1","volume-title":"Complex scheduling","author":"P Brucker","year":"2011","unstructured":"Brucker P, Knust S (2011) Complex scheduling, 2nd edn. Springer, Berlin","edition":"2"},{"issue":"2","key":"20_CR2","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. Comb. Optim. 26(2):345\u2013371. doi: 10.1007\/s10878-012-9466-y","journal-title":"J. Comb. Optim."},{"unstructured":"Condotta A (2011) Scheduling with due dates and time-lags: new theoretical results and applications. PhD thesis, University of Leeds","key":"20_CR3"},{"issue":"16\u201317","key":"20_CR4","doi-asserted-by":"publisher","first-page":"2370","DOI":"10.1016\/j.dam.2012.05.026","volume":"160","author":"A Condotta","year":"2012","unstructured":"Condotta A, Shakhlevich N (2012) Scheduling coupled-operation jobs with exact time-lags. Discret Appl Math 160(16\u201317):2370\u20132388. doi: 10.1016\/j.dam.2012.05.026","journal-title":"Discret Appl Math"},{"issue":"1","key":"20_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/00207546708929764","volume":"6","author":"S Eilon","year":"1967","unstructured":"Eilon S, Hodgson R (1967) Job shops scheduling with due dates. Int J Prod Res 6(1):1\u201313","journal-title":"Int J Prod Res"},{"key":"20_CR6","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. GSIA, Carnegie Mellon University, Pittsburgh"},{"issue":"2","key":"20_CR7","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1142\/S0129054107004711","volume":"18","author":"JYT Leung","year":"2007","unstructured":"Leung JYT, Li H, Zhao H (2007) Scheduling two-machine flow shops with exact delays. Int J Found Comput Sci 18(2):341\u2013359","journal-title":"Int J Found Comput Sci"},{"issue":"1","key":"20_CR8","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.ejor.2011.01.046","volume":"212","author":"Y Mati","year":"2011","unstructured":"Mati Y, Dauz\u00e8re-P\u00e9r\u00e8s S, Lahlou C (2011) A general approach for optimizing regular criteria in the job-shop scheduling problem. Eur J Oper Res 212(1):33\u201342. doi: 10.1016\/j.ejor.2011.01.046","journal-title":"Eur J Oper Res"},{"issue":"2","key":"20_CR9","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1145\/130844.130853","volume":"24","author":"C McGeoch","year":"1992","unstructured":"McGeoch C (1992) Analyzing algorithms by simulation: variance reduction techniques and simulation speedups. ACM Comput Surv 24(2):195\u2013212","journal-title":"ACM Comput Surv"},{"key":"20_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-2361-4","volume-title":"Scheduling: theory, algorithms, and systems","author":"ML Pinedo","year":"2012","unstructured":"Pinedo ML (2012) Scheduling: theory, algorithms, and systems, 4th edn. Springer, New York","edition":"4"},{"key":"20_CR11","volume-title":"Combinatorial optimization, polyhedra and efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver A (2003) Combinatorial optimization, polyhedra and efficiency. Springer, Berlin"},{"issue":"3","key":"20_CR12","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/s00186-006-0056-6","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. doi: 10.1007\/s00186-006-0056-6","journal-title":"Math Methods Oper Res"},{"issue":"10","key":"20_CR13","doi-asserted-by":"publisher","first-page":"1495","DOI":"10.1287\/mnsc.38.10.1495","volume":"38","author":"RH Storer","year":"1992","unstructured":"Storer RH, Wu SD, Vaccari R (1992) New search spaces for sequencing problems with application to job shop scheduling. Manag Sci 38(10):1495\u20131509. doi: 10.1287\/mnsc.38.10.1495","journal-title":"Manag Sci"},{"key":"20_CR14","first-page":"281","volume":"2","author":"T Yamada","year":"1992","unstructured":"Yamada T, Nakano R (1992) A genetic algorithm applicable to large-scale job-shop problems. Parallel Problem Solving Nat 2:281\u2013290","journal-title":"Parallel Problem Solving Nat"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0020-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-016-0020-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0020-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0020-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:23:29Z","timestamp":1559262209000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-016-0020-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,10]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["20"],"URL":"https:\/\/doi.org\/10.1007\/s10878-016-0020-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2016,5,10]]}}}