{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T06:42:46Z","timestamp":1778827366223,"version":"3.51.4"},"reference-count":6,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1993,12,1]],"date-time":"1993-12-01T00:00:00Z","timestamp":754704000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[1993,12]]},"DOI":"10.1016\/0167-6377(93)90088-x","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T18:40:45Z","timestamp":1056998445000},"page":"245-250","source":"Crossref","is-referenced-by-count":9,"title":["Scheduling unit time open shops to minimize the weighted number of late jobs"],"prefix":"10.1016","volume":"14","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":"Thomas","family":"Tautenhahn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Werner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(93)90088-X_BIB1","first-page":"59","article-title":"Open shop problems with unit time operations","volume":"37","author":"Brucker","year":"1993","journal-title":"Z. Oper. Res."},{"key":"10.1016\/0167-6377(93)90088-X_BIB2","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1145\/321978.321985","article-title":"Open-Shop Scheduling to Minimize Finish Time","volume":"23","author":"Gonzalez","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/0167-6377(93)90088-X_BIB3","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimization and approximation in deterministic sequencing and scheduling: A survey","volume":"5","author":"Graham","year":"1979","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0167-6377(93)90088-X_BIB4","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\/0167-6377(93)90088-X_BIB5","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\/0167-6377(93)90088-X_BIB6","article-title":"Scheduling unit time openshops with deadlines","author":"Tautenhahn","year":"1992","journal-title":"Oper. Res."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779390088X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779390088X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T09:52:19Z","timestamp":1552902739000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016763779390088X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":6,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1993,12]]}},"alternative-id":["016763779390088X"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(93)90088-x","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}