{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T10:29:49Z","timestamp":1781087389432,"version":"3.54.1"},"reference-count":16,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1997,6,1]],"date-time":"1997-06-01T00:00:00Z","timestamp":865123200000},"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":5890,"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":[[1997,6]]},"DOI":"10.1016\/s0166-218x(96)00116-3","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:10:20Z","timestamp":1052766620000},"page":"43-59","source":"Crossref","is-referenced-by-count":108,"title":["A branch & bound algorithm for the open-shop problem"],"prefix":"10.1016","volume":"76","author":[{"given":"Peter","family":"Brucker","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Johann","family":"Hurink","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bernd","family":"Jurisch","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Birgit","family":"W\u00f6stmann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(96)00116-3_BIB1","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF02243845","article-title":"Constructive heuristic algorithms for the open-shop problem","volume":"51","author":"Br\u00e4sel","year":"1993","journal-title":"Computing"},{"key":"10.1016\/S0166-218X(96)00116-3_BIB2","first-page":"59","article-title":"Open-shop problems with unit time operations","volume":"73","author":"Brucker","year":"1993","journal-title":"ZOR"},{"key":"10.1016\/S0166-218X(96)00116-3_BIB3","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/BF02085636","article-title":"The job-shop problem and immediate selection","volume":"50","author":"Brucker","year":"1994","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0166-218X(96)00116-3_BIB4","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0166-218X(94)90204-6","article-title":"A fast branch & bound algorithm for the job-shop scheduling problem","volume":"49","author":"Brucker","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(96)00116-3_BIB5","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/S0377-2217(82)80007-6","article-title":"The one machine sequencing problem","volume":"11","author":"Carlier","year":"1982","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/S0166-218X(96)00116-3_BIB6","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\/S0166-218X(96)00116-3_BIB7","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1145\/321978.321985","article-title":"Open-shop scheduling to minimize finish time","volume":"23","author":"Gonzales","year":"1976","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0166-218X(96)00116-3_BIB8","unstructured":"B. Jurisch and W. Kubiak, Open-shop problems with resource constraints, Oper. Res., to appear."},{"key":"10.1016\/S0166-218X(96)00116-3_BIB9","first-page":"284","article-title":"A note on the complexity of open-shop scheduling problems","volume":"29","author":"Kubiak","year":"1991","journal-title":"INFOR"},{"key":"10.1016\/S0166-218X(96)00116-3_BIB10","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1287\/opre.36.4.553","article-title":"Scheduling open-shops with unit execution times to minimize functions of due dates","volume":"36","author":"Liu","year":"1988","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(96)00116-3_BIB11","article-title":"Heuristische L\u00f6sungsverfahren f\u00fcr General Shop Probleme","author":"Neumann","year":"1993"},{"key":"10.1016\/S0166-218X(96)00116-3_BIB12","series-title":"Combinatorial optimization: Algorithms and Complexity","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/S0166-218X(96)00116-3_BIB13","article-title":"Ein effizientes Branch & Bound-Verfahren f\u00fcr das Job-Shop Scheduling Problem","author":"Sievers","year":"1989"},{"key":"10.1016\/S0166-218X(96)00116-3_BIB14","article-title":"Benchmarks for basic scheduling problems","author":"Taillard","year":"1989","journal-title":"ORWP 89\/21, Lausanne"},{"key":"10.1016\/S0166-218X(96)00116-3_BIB15","series-title":"Graphen - Algorithmen - Programme","author":"Walther","year":"1987"},{"key":"10.1016\/S0166-218X(96)00116-3_BIB16","article-title":"Ein Branch & Bound-Verfahren f\u00fcr das Open-Shop Problem","author":"W\u00f6stmann","year":"1993"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96001163?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96001163?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T14:29:06Z","timestamp":1556116146000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X96001163"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,6]]},"references-count":16,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1997,6]]}},"alternative-id":["S0166218X96001163"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(96)00116-3","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,6]]}}}