{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T12:42:05Z","timestamp":1784205725274,"version":"3.55.0"},"reference-count":17,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1994,3,1]],"date-time":"1994-03-01T00:00:00Z","timestamp":762480000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7078,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1994,3]]},"DOI":"10.1016\/0166-218x(94)90204-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"107-127","source":"Crossref","is-referenced-by-count":335,"title":["A branch and bound algorithm for the job-shop scheduling problem"],"prefix":"10.1016","volume":"49","author":[{"given":"Peter","family":"Brucker","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bernd","family":"Jurisch","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bernd","family":"Sievers","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(94)90204-6_BIB1","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/mnsc.34.3.391","article-title":"The shifting bottleneck procedure for job-shop scheduling","volume":"34","author":"Adams","year":"1988","journal-title":"Management Sci."},{"key":"10.1016\/0166-218X(94)90204-6_BIB2","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1287\/ijoc.3.2.149","article-title":"A computational study of job shop scheduling, CMU-CS-90-145","volume":"3","author":"Applegate","year":"1991","journal-title":"ORSA J. Comput."},{"key":"10.1016\/0166-218X(94)90204-6_BIB3","series-title":"Master's thesis","article-title":"Job-shop scheduling: A comparison of three enumeration schemes in a branch and bound approach","author":"Bouma","year":"1982"},{"key":"10.1016\/0166-218X(94)90204-6_BIB4","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/0377-2217(93)90174-L","article-title":"A new lower bound for the job-shop scheduling problem","volume":"64","author":"Brucker","year":"1993","journal-title":"European J. Oper. Res."},{"key":"10.1016\/0166-218X(94)90204-6_BIB5","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/0377-2217(92)90312-W","article-title":"Job-shop (C-codes)","volume":"57","author":"Brucker","year":"1992","journal-title":"European J. Oper. Res."},{"key":"10.1016\/0166-218X(94)90204-6_BIB6","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/S0377-2217(82)80007-6","article-title":"One machine problem","volume":"11","author":"Carlier","year":"1982","journal-title":"European J. Oper. Res."},{"key":"10.1016\/0166-218X(94)90204-6_BIB7","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1287\/mnsc.35.2.164","article-title":"An algorithm for solving the job-shop problem","volume":"35","author":"Carlier","year":"1989","journal-title":"Management Sci."},{"key":"10.1016\/0166-218X(94)90204-6_BIB8","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF03543071","article-title":"A practical use of Jackson's preemptive schedule for solving the job shop problem","volume":"26","author":"Carlier","year":"1990","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/0166-218X(94)90204-6_BIB9","first-page":"67","article-title":"Algorytm blokowy szeregowania operacji w systemie gniazdowyn","volume":"1","author":"Grabowski","year":"1988","journal-title":"Przeglad Statystyczny R. XXXXV"},{"key":"10.1016\/0166-218X(94)90204-6_BIB10","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(86)90191-8","article-title":"A block approach for single machine scheduling with relase dates and due dates","volume":"26","author":"Grabowski","year":"1986","journal-title":"European J. Oper. Res."},{"key":"10.1016\/0166-218X(94)90204-6_BIB11","unstructured":"B. Jurisch and B. Sievers, Ein Branch and Bound Verfahren f\u00fcr des Job-Shop Scheduling Problem, Osnabr\u00fcck. Schrift. Math. Reihe P, Heft 122."},{"key":"10.1016\/0166-218X(94)90204-6_BIB12","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1287\/opre.40.1.113","article-title":"Job shop scheduling by simulated annealing","volume":"40","author":"van Laarhoven","year":"1992","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(94)90204-6_BIB13","first-page":"343","article-title":"Complexity of machine scheduling problems","volume":"1","author":"Lenstra","year":"1977"},{"key":"10.1016\/0166-218X(94)90204-6_BIB14","series-title":"Industrial Scheduling","author":"Muth","year":"1963"},{"key":"10.1016\/0166-218X(94)90204-6_BIB15","unstructured":"B. Roy and B. Sussmann, Les probl\u00e8mes d'ordonnancement avec contraintes disjonctives, Note DS no. 9 bis, SEMA, Paris."},{"key":"10.1016\/0166-218X(94)90204-6_BIB16","unstructured":"M. Widmer, Job-shop scheduling with tooling constraints: a tabu search approach, OR working paper 89\/22, D\u00e9partement of Math\u00e9matiques, Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne."},{"key":"10.1016\/0166-218X(94)90204-6_BIB17","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1287\/opre.23.3.475","article-title":"On scheduling with ready times and due dates to minimize maximum lateness","volume":"23","author":"McMahon","year":"1975","journal-title":"Oper. Res."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94902046?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94902046?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T11:00:19Z","timestamp":1580900419000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X94902046"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":17,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["0166218X94902046"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(94)90204-6","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1994,3]]}}}