{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T18:06:57Z","timestamp":1758478017175},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1994,12,1]],"date-time":"1994-12-01T00:00:00Z","timestamp":786240000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[1994,12]]},"DOI":"10.1007\/bf02085636","type":"journal-article","created":{"date-parts":[[2005,8,14]],"date-time":"2005-08-14T11:22:06Z","timestamp":1124018526000},"page":"73-114","source":"Crossref","is-referenced-by-count":38,"title":["The job-shop problem and immediate selection"],"prefix":"10.1007","volume":"50","author":[{"given":"Peter","family":"Brucker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernd","family":"Jurisch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Kr\u00e4mer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02085636_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, The shifting bottleneck procedure for job-shop scheduling, Manag. Sci. 34(1988)391\u2013401.","journal-title":"Manag. Sci."},{"key":"BF02085636_CR2","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1287\/ijoc.3.2.149","volume":"3","author":"D. Applegate","year":"1991","unstructured":"D. Applegate and W. Cook, A computational study of the job shop scheduling problem, ORSA J. Comp. 3(1991)149\u2013156.","journal-title":"ORSA J. Comp."},{"key":"BF02085636_CR3","unstructured":"P. Brucker, B. Jurisch and B. Sievers, A branch and bound algorithm for the job-shop scheduling problem(1991), to appear in Discr. Appl. Math."},{"key":"BF02085636_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, One machine sequencing problem, Eur. J. Oper. Res. 11(1982)42\u201347.","journal-title":"Eur. J. Oper. Res."},{"key":"BF02085636_CR5","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1287\/mnsc.35.2.164","volume":"35","author":"J. Carlier","year":"1989","unstructured":"J. Carlier and E. Pinson, An algorithm for solving the job-shop problem, Manag. Sci. 35(1989)164\u2013176.","journal-title":"Manag. Sci."},{"key":"BF02085636_CR6","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF03543071","volume":"26","author":"J. Carlier","year":"1990","unstructured":"J. Carlier and E. Pinson, A practical use of Jackson's preemptive schedule for solving the job shop problem, Ann. Oper. Res. 26(1990)269\u2013287.","journal-title":"Ann. Oper. Res."},{"key":"BF02085636_CR7","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1080\/02331939208843823","volume":"25","author":"G. Dewe\u00df","year":"1992","unstructured":"G. Dewe\u00df, An existence theorem for packing problems with implications for the computation of optimal machine schedules, Optimization 25(1992)261\u2013269.","journal-title":"Optimization"},{"key":"BF02085636_CR8","doi-asserted-by":"crossref","unstructured":"M.J. Fischer and A.R. Meyer, Boolean matrix multiplication and transitive closure,12th Annual Symp. on Switching and Automata Theory, East Lansing, MI (1971) pp. 129\u2013137.","DOI":"10.1109\/SWAT.1971.4"},{"key":"BF02085636_CR9","volume-title":"Industrial Scheduling","author":"J.F. Muth","year":"1963","unstructured":"J.F. Muth and G.L. Thompson,Industrial Scheduling (Prentice Hall, Englewood Cliffs, NJ, 1963)."},{"key":"BF02085636_CR10","volume-title":"Les Probl\u00e8mes d'ordonnancement avec contraintes disjonctives, Note DS no. 9 bis","author":"B. Roy","year":"1964","unstructured":"B. Roy and B. Sussmann, Les Probl\u00e8mes d'ordonnancement avec contraintes disjonctives, Note DS no. 9 bis, SEMA, Paris (1964)."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02085636.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02085636\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02085636","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T00:47:51Z","timestamp":1586393271000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02085636"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["BF02085636"],"URL":"https:\/\/doi.org\/10.1007\/bf02085636","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}