{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T21:44:41Z","timestamp":1778276681933,"version":"3.51.4"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2008,8,1]],"date-time":"2008-08-01T00:00:00Z","timestamp":1217548800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2008,8]]},"DOI":"10.1007\/s10951-008-0067-7","type":"journal-article","created":{"date-parts":[[2008,6,3]],"date-time":"2008-06-03T13:06:08Z","timestamp":1212498368000},"page":"253-262","source":"Crossref","is-referenced-by-count":68,"title":["Job shop scheduling with setup times, deadlines and precedence constraints"],"prefix":"10.1007","volume":"11","author":[{"given":"Egon","family":"Balas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Neil","family":"Simonetti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alkis","family":"Vazacopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,8,1]]},"reference":[{"key":"67_CR1","doi-asserted-by":"publisher","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. Management Science, 34, 391\u2013401.","journal-title":"Management Science"},{"key":"67_CR2","doi-asserted-by":"crossref","unstructured":"Artigues, C., & Feillet, D. (2006, forthcoming). A\u00a0branch and bound method for the job-shop problem with sequence-dependent setup times. Annals of Operations Research.","DOI":"10.1007\/s10479-007-0283-0"},{"key":"67_CR3","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1023\/A:1018939709890","volume":"84","author":"E. Balas","year":"1999","unstructured":"Balas, E. (1999). New classes of efficiently solvable generalized traveling salesman problems. Annals of Operations Research, 84, 529\u2013558.","journal-title":"Annals of Operations Research"},{"key":"67_CR4","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1287\/ijoc.13.1.56.9748","volume":"13","author":"E. Balas","year":"2001","unstructured":"Balas, E., & Simonetti, N. (2001). Linear time dynamic programming algorithms for new classes of restricted TSPs. INFORMS Journal on Computing, 13, 56\u201375.","journal-title":"INFORMS Journal on Computing"},{"key":"67_CR5","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1287\/mnsc.44.2.262","volume":"44","author":"E. Balas","year":"1998","unstructured":"Balas, E., & Vazacopoulos, A. (1998). Guided local search with shifting bottleneck for job shop scheduling. Management Science, 44, 262\u2013275.","journal-title":"Management Science"},{"key":"67_CR6","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1287\/mnsc.41.1.94","volume":"41","author":"E. Balas","year":"1995","unstructured":"Balas, E., Lenstra, J. K., & Vazacopoulos, A. (1995). The one-machine problem with delayed precedence constraints and its use in job shop scheduling. Management Science, 41, 94\u2013109.","journal-title":"Management Science"},{"key":"67_CR7","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1023\/A:1009750409895","volume":"1","author":"E. Balas","year":"1998","unstructured":"Balas, E., Lancia, G., Serafini, P., & Vazacopoulos, A. (1998). Job shop scheduling with deadlines. Journal of Combinatorial Optimization, 1, 329\u2013353.","journal-title":"Journal of Combinatorial Optimization"},{"key":"67_CR8","doi-asserted-by":"publisher","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 scheduling problem with sequence dependent setup times. Operations Research Spektrum, 18, 145\u2013161.","journal-title":"Operations Research Spektrum"},{"key":"67_CR9","unstructured":"Buscaylet, F., & Artigues, C. (2003). A\u00a0fast tabu search method for the job-shop problem with sequence-dependent setup times. In MIC 2003, the fifth metaheuristics international conference, Kyoto, Japan."},{"key":"67_CR10","doi-asserted-by":"publisher","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. European Journal of Operational Research, 11, 42\u201347.","journal-title":"European Journal of Operational Research"},{"key":"67_CR11","unstructured":"Focacci, F., Laborie, P., & Nuijten, W. (2000). Solving scheduling problems with setup times and alternative resources. In Fifth international conference on artificial intelligence planning and scheduling (pp. 92\u2013101), Breckenbridge, CO."},{"key":"67_CR12","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1137\/0110015","volume":"10","author":"M. Held","year":"1962","unstructured":"Held, M., & Karp, R. M. (1962). A dynamic programming approach to sequencing problems. SIAM Journal of Applied Mathematics, 10, 196\u2013210.","journal-title":"SIAM Journal of Applied Mathematics"},{"issue":"2","key":"67_CR13","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0278-6125(94)90023-X","volume":"13","author":"I. Ovacik","year":"1994","unstructured":"Ovacik, I., & Uzsoy, R. (1994). Exploiting shop floor status information to schedule complex job shops. Journal of Manufacturing Systems, 13(2), 73\u201384.","journal-title":"Journal of Manufacturing Systems"},{"key":"67_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6329-7","volume-title":"Decomposition methods for complex factory scheduling problems","author":"I. Ovacik","year":"1997","unstructured":"Ovacik, I., & Uzsoy, R. (1997). Decomposition methods for complex factory scheduling problems. Dordrecht: Kluwer Academic."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-008-0067-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-008-0067-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-008-0067-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-008-0067-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T05:39:41Z","timestamp":1559453981000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-008-0067-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,8]]}},"alternative-id":["67"],"URL":"https:\/\/doi.org\/10.1007\/s10951-008-0067-7","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,8]]}}}