{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:04:59Z","timestamp":1763467499564,"version":"3.41.0"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1998,12,1]],"date-time":"1998-12-01T00:00:00Z","timestamp":912470400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,12,1]],"date-time":"1998-12-01T00:00:00Z","timestamp":912470400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Optimization"],"published-print":{"date-parts":[[1998,12]]},"DOI":"10.1023\/a:1009750409895","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T22:50:41Z","timestamp":1040597441000},"page":"329-353","source":"Crossref","is-referenced-by-count":22,"title":["Job Shop Scheduling With Deadlines"],"prefix":"10.1007","volume":"1","author":[{"given":"Egon","family":"Balas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe","family":"Lancia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Serafini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alkiviadis","family":"Vazacopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"151706_CR1","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/mnsc.34.3.391","volume":"34","author":"J. Adams","year":"1988","unstructured":"J. Adams, E. Balas, and D. Zawack, \u201cThe shifting bottleneck procedure for job shop scheduling,\u201d Management Science, vol. 34, pp. 391\u2013401, 1988.","journal-title":"Management Science"},{"key":"151706_CR2","series-title":"Management Science Research Report","volume-title":"Guided local search and shifting bottleneck procedure for job shop scheduling","author":"E. Balas","year":"1994","unstructured":"E. Balas and A. Vazacopoulos, \u201cGuided local search and shifting bottleneck procedure for job shop scheduling,\u201d Management Science Research Report #MSSR\u2013609, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, 1994. To appear in Management Science."},{"key":"151706_CR3","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1287\/mnsc.41.1.94","volume":"41","author":"E. Balas","year":"1995","unstructured":"E. Balas, J.K. Lenstra, and A. Vazacopoulos, \u201cThe one machine problem with delayed precedence constraints and its use in job shop scheduling,\u201d Management Science, vol. 41, pp. 94\u2013109, 1995.","journal-title":"Management Science"},{"key":"151706_CR4","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/S0377-2217(82)80007-6","volume":"11","author":"J. Carlier","year":"1982","unstructured":"J. Carlier, \u201cThe one-machine sequencing problem,\u201d European Journal of Operational Research, vol. 11, pp. 42\u201347, 1982.","journal-title":"European Journal of Operational Research"},{"key":"151706_CR5","unstructured":"E. Demirkol, S. Mehta, and R. Uzsoy, \u201cBenchmarking for shop scheduling problems,\u201d Research Memorandum No. 96-4, Purdue University, 1996."},{"key":"151706_CR6","volume-title":"Industrial Scheduling","author":"H. Fisher","year":"1963","unstructured":"H. Fisher and G.L. Thompson, \u201cProbabilistic learning combinations of local job-shop scheduling rules,\u201d in Industrial Scheduling, J.F. Muth and G.L. Thompson (Eds.), Prentice-Hall: Englewood Cliffs, NJ, 1963."},{"key":"151706_CR7","unstructured":"V.J. Leon, Personal communication, 1992."},{"key":"151706_CR8","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1002\/1520-6750(199202)39:1<53::AID-NAV3220390105>3.0.CO;2-C","volume":"39","author":"V.J. Leon","year":"1992","unstructured":"V.J. Leon and S.D. Wu, \u201cOn scheduling with ready-times, due-dates and vacations,\u201d Naval Research Logistics, vol. 39, pp. 53\u201365, 1992.","journal-title":"Naval Research Logistics"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009750409895.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009750409895\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009750409895.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:14:25Z","timestamp":1751282065000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009750409895"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,12]]},"references-count":8,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1998,12]]}},"alternative-id":["151706"],"URL":"https:\/\/doi.org\/10.1023\/a:1009750409895","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[1998,12]]}}}