{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T14:39:47Z","timestamp":1773326387536,"version":"3.50.1"},"reference-count":10,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1995,4,1]],"date-time":"1995-04-01T00:00:00Z","timestamp":796694400000},"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":6682,"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":[[1995,4]]},"DOI":"10.1016\/0166-218x(93)e0156-s","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:14:35Z","timestamp":1027649675000},"page":"11-21","source":"Crossref","is-referenced-by-count":5,"title":["A polynomial algorithm for an open shop problem with unit processing times and tree constraints"],"prefix":"10.1016","volume":"59","author":[{"given":"H.","family":"Br\u00e4sel","sequence":"first","affiliation":[]},{"given":"D.","family":"Kluge","sequence":"additional","affiliation":[]},{"given":"F.","family":"Werner","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(93)E0156-S_BIB1","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0305-0548(84)90016-9","article-title":"Openshop and flowshop scheduling to minimize sum of completion times","volume":"11","author":"Adiri","year":"1984","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/0166-218X(93)E0156-S_BIB2","series-title":"Dissertation B","article-title":"Lateinische Rechtecke und Maschinenbelegung","author":"Br\u00e4sel","year":"1990"},{"key":"10.1016\/0166-218X(93)E0156-S_BIB3","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0377-2217(94)90335-2","article-title":"A polynomial algorithm for the [n\/m\/O, tij = 1, tree\/Cmax] problem European","volume":"72","author":"Br\u00e4sel","year":"1994","journal-title":"J. Oper. Res."},{"key":"10.1016\/0166-218X(93)E0156-S_BIB4","first-page":"339","article-title":"Open shop problems with unit time operations","volume":"37","author":"Brucker","year":"1993","journal-title":"Z. Oper. Res."},{"key":"10.1016\/0166-218X(93)E0156-S_BIB5","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1287\/moor.7.1.57","article-title":"Unit execution time shop problems","volume":"7","author":"Gonzales","year":"1982","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0166-218X(93)E0156-S_BIB6","series-title":"Report BW 138\/81","article-title":"Computer aided complexity classification of deterministic scheduling problems","author":"Lageweg","year":"1981"},{"key":"10.1016\/0166-218X(93)E0156-S_BIB7","series-title":"Report BS-R8909","article-title":"Sequencing and scheduling: algorithms and complexity","author":"Lawler","year":"1989"},{"key":"10.1016\/0166-218X(93)E0156-S_BIB8","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\/0166-218X(93)E0156-S_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.6.1.1","article-title":"Scheduling with deadlines and loss functions","volume":"6","author":"McNaughton","year":"1959","journal-title":"Management Sci."},{"key":"10.1016\/0166-218X(93)E0156-S_BIB10","series-title":"Theory of Scheduling-Multistage Systems","author":"Tanaev","year":"1989"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X93E0156S?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X93E0156S?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T21:54:58Z","timestamp":1555278898000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X93E0156S"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,4]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,4]]}},"alternative-id":["0166218X93E0156S"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(93)e0156-s","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1995,4]]}}}