{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T17:58:08Z","timestamp":1773856688234,"version":"3.50.1"},"reference-count":6,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1992,6,1]],"date-time":"1992-06-01T00:00:00Z","timestamp":707356800000},"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":[[1992,6]]},"DOI":"10.1016\/0167-6377(92)90001-j","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T14:40:45Z","timestamp":1056984045000},"page":"261-266","source":"Crossref","is-referenced-by-count":70,"title":["Approximation algorithms for scheduling a single machine to minimize total late work"],"prefix":"10.1016","volume":"11","author":[{"given":"C.N","family":"Potts","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.N","family":"Van Wassenhove","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(92)90001-J_BIB1","first-page":"415","article-title":"Scheduling preemptible tasks on parallel processors with information loss","volume":"3","author":"Blazewicz","year":"1984","journal-title":"Technique et Science Informatiques"},{"key":"10.1016\/0167-6377(92)90001-J_BIB2","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0166-218X(81)90008-1","article-title":"Fast approximation algorithms for job sequencing with deadlines","volume":"3","author":"Gens","year":"1981","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0167-6377(92)90001-J_BIB3","doi-asserted-by":"crossref","unstructured":"L.A. Hall and D.B. Shmoys, \u201cJackson's rule for single-machine scheduling: Making a good heuristic better\u201d, Math. Oper. Res., to appear.","DOI":"10.1287\/moor.17.1.22"},{"key":"10.1016\/0167-6377(92)90001-J_BIB4","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0167-6377(82)90022-0","article-title":"A fully polynomial approximation scheme for the total tardiness problem","volume":"1","author":"Lawler","year":"1982","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0167-6377(92)90001-J_BIB5","doi-asserted-by":"crossref","unstructured":"C.N. Potts and L.N. Van Wassenhove, \u201cSingle machine scheduling to minimize total late work\u201d, Oper. Res., to appear.","DOI":"10.1287\/opre.40.3.586"},{"key":"10.1016\/0167-6377(92)90001-J_BIB6","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/321921.321934","article-title":"Algorithms for scheduling independent tasks","volume":"23","author":"Sahni","year":"1976","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779290001J?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779290001J?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T05:50:21Z","timestamp":1552888221000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016763779290001J"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,6]]},"references-count":6,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1992,6]]}},"alternative-id":["016763779290001J"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(92)90001-j","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1992,6]]}}}