{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T03:32:47Z","timestamp":1778556767695,"version":"3.51.4"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,3,16]],"date-time":"2012-03-16T00:00:00Z","timestamp":1331856000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2013,8]]},"DOI":"10.1007\/s10878-012-9466-y","type":"journal-article","created":{"date-parts":[[2012,3,15]],"date-time":"2012-03-15T21:45:30Z","timestamp":1331847930000},"page":"345-371","source":"Crossref","is-referenced-by-count":16,"title":["Optimal job insertion in the no-wait job shop"],"prefix":"10.1007","volume":"26","author":[{"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":[[2012,3,16]]},"reference":[{"issue":"3","key":"9466_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"},{"key":"9466_CR2","doi-asserted-by":"crossref","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 tabu search algorithm for the no-wait job shop problem. Comput Ind Eng 56:1502\u20131509","journal-title":"Comput Ind Eng"},{"key":"9466_CR3","doi-asserted-by":"crossref","DOI":"10.1002\/9781118033142","volume-title":"Combinatorial optimization","author":"WJ Cook","year":"1997","unstructured":"Cook WJ, Cunningham WH, Pulleyblank WR, Schrijver A (1997) Combinatorial optimization. Wiley-Interscience, New York"},{"key":"9466_CR4","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1016\/j.ejor.2005.12.025","volume":"177","author":"H Gr\u00f6flin","year":"2007","unstructured":"Gr\u00f6flin H, Klinkert A (2007) Feasible insertions in job shop scheduling, short cycles and stable sets. Cent Eur J Oper Res 177:763\u2013785","journal-title":"Cent Eur J Oper Res"},{"key":"9466_CR5","doi-asserted-by":"crossref","first-page":"3643","DOI":"10.1016\/j.dam.2009.02.020","volume":"157","author":"H Gr\u00f6flin","year":"2009","unstructured":"Gr\u00f6flin H, Klinkert A (2009) A new neighborhood and tabu search for the blocking job shop. Discrete Appl Math 157:3643\u20133655","journal-title":"Discrete Appl Math"},{"key":"9466_CR6","unstructured":"Kis T (2001) Insertion techniques for job shop scheduling. Ph.D. thesis, Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne"},{"key":"9466_CR7","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/S0166-218X(02)00502-4","volume":"128","author":"T Kis","year":"2003","unstructured":"Kis T, Hertz A (2003) A lower bound for the job insertion problem. Discrete Appl Math 128:395\u2013419","journal-title":"Discrete Appl Math"},{"key":"9466_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. GSIA, Carnegie Mellon University, Pittsburgh"},{"key":"9466_CR9","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":"9466_CR10","doi-asserted-by":"crossref","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":"9466_CR11","doi-asserted-by":"crossref","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","journal-title":"Manag Sci"},{"key":"9466_CR12","unstructured":"van\u00a0den Broek J (2009) MIP-based approaches for complex planning problems. Ph.D. thesis, Technische Universiteit Eindhoven"},{"issue":"2","key":"9466_CR13","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0166-218X(93)E0127-K","volume":"58","author":"F Werner","year":"1995","unstructured":"Werner F, Winkler A (1995) Insertion techniques for the heuristic solution of the job shop problem. Discrete Appl Math 58(2):191\u2013211","journal-title":"Discrete Appl Math"},{"key":"9466_CR14","first-page":"281","volume-title":"Parallel problem solving from nature","author":"T Yamada","year":"1992","unstructured":"Yamada T, Nakano R (1992) A genetic algorithm applicable to large-scale job-shop problems. In: Parallel problem solving from nature, vol\u00a02, pp\u00a0281\u2013290"},{"issue":"2","key":"9466_CR15","doi-asserted-by":"crossref","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":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9466-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-012-9466-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9466-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:17Z","timestamp":1559276597000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-012-9466-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,16]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["9466"],"URL":"https:\/\/doi.org\/10.1007\/s10878-012-9466-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,3,16]]}}}