{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T17:00:03Z","timestamp":1776790803286,"version":"3.51.2"},"reference-count":10,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1994,12,1]],"date-time":"1994-12-01T00:00:00Z","timestamp":786240000000},"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":[[1994,12]]},"DOI":"10.1016\/0167-6377(94)90041-8","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T18:40:45Z","timestamp":1056998445000},"page":"277-283","source":"Crossref","is-referenced-by-count":35,"title":["Scheduling shops to minimize the weighted number of late jobs"],"prefix":"10.1016","volume":"16","author":[{"given":"Joanna","family":"J\u00f3zefowska","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernd","family":"Jurisch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wieslaw","family":"Kubiak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(94)90041-8_BIB1","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1978"},{"key":"10.1016\/0167-6377(94)90041-8_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. Assoc. Comput. Mach."},{"key":"10.1016\/0167-6377(94)90041-8_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(94)90041-8_BIB4","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1002\/nav.3800030307","article-title":"An extension of Johnson's results on job lot scheduling","volume":"3","author":"Jackson","year":"1956","journal-title":"Naval Res. Logist. Q."},{"key":"10.1016\/0167-6377(94)90041-8_BIB5","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/nav.3800010110","article-title":"Optimal two- and three-stage production schedules with setup times included","volume":"1","author":"Johnson","year":"1954","journal-title":"Naval Res. Logist. Q."},{"key":"10.1016\/0167-6377(94)90041-8_BIB6","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0167-6377(94)90041-8_BIB7_1","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1287\/moor.6.1.153","article-title":"Minimizing maximum lateness in a two-machine open shop","volume":"6","author":"Lawler","year":"1981","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0167-6377(94)90041-8_BIB7_2","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1287\/moor.7.4.635","article-title":"Erratum","volume":"7","author":"Lawler","year":"1982","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0167-6377(94)90041-8_BIB8","first-page":"445","article-title":"Sequencing and scheduling: algorithms and complexity","author":"Lawler","year":"1993"},{"key":"10.1016\/0167-6377(94)90041-8_BIB9","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","article-title":"Complexity of machine scheduling problems","volume":"1","author":"Lenstra","year":"1977","journal-title":"Ann. Discrete Math."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637794900418?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637794900418?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:53:15Z","timestamp":1552902795000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167637794900418"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":10,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["0167637794900418"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(94)90041-8","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}