{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T02:51:51Z","timestamp":1773802311320,"version":"3.50.1"},"reference-count":10,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1995,3,1]],"date-time":"1995-03-01T00:00:00Z","timestamp":794016000000},"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":[[1995,3]]},"DOI":"10.1016\/0167-6377(95)91591-z","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T02:21:32Z","timestamp":1052792492000},"page":"85-87","source":"Crossref","is-referenced-by-count":38,"title":["Improving the complexities of approximation algorithms for optimization problems"],"prefix":"10.1016","volume":"17","author":[{"given":"Mikhail Y.","family":"Kovalyov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(95)91591-Z_BIB1","series-title":"Working paper 2\/93","article-title":"Due-date assignment and scheduling with set-ups on a single machine","author":"Cheng","year":"1993"},{"key":"10.1016\/0167-6377(95)91591-Z_BIB2","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0166-218X(81)90008-1","article-title":"Fast approximation algorithm for job sequencing with deadlines","volume":"3","author":"Gens","year":"1981","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0167-6377(95)91591-Z_BIB3","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1145\/321941.321951","article-title":"Exact and approximate algorithms for scheduling nonidentical processors","volume":"23","author":"Horowitz","year":"1976","journal-title":"J. Assoc. Comput. Machinery"},{"key":"10.1016\/0167-6377(95)91591-Z_BIB4","series-title":"Single machine scheduling with deadlines and resource dependent processing times","author":"Janiak","year":"1993"},{"key":"10.1016\/0167-6377(95)91591-Z_BIB5","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1287\/moor.19.1.86","article-title":"A fully polynomial approximation scheme for scheduling a single machine to minimize total weighted late work","volume":"19","author":"Kovalyov","year":"1994","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0167-6377(95)91591-Z_BIB6","unstructured":"M.Y. Kovalyov, C.N. Potts and L.N. Van Wassenhove, \u201cSingle machine scheduling with set-ups to minimize the number of late items: algorithms, complexity and approximation\u201d, in submission."},{"key":"10.1016\/0167-6377(95)91591-Z_BIB7","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/S0167-5060(08)70742-8","article-title":"A \u2018pseudopolynomial\u2019 algorithm for sequencing jobs to minimize total tardiness","volume":"1","author":"Lawler","year":"1977","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0167-6377(95)91591-Z_BIB8","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(95)91591-Z_BIB9","unstructured":"C.N. Potts and L.N. Van Wassenhove, \u201cSingle machine scheduling to minimize total late work\u201d, to appear in Oper. Res."},{"key":"10.1016\/0167-6377(95)91591-Z_BIB10","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. Machinery"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779591591Z?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779591591Z?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T21:27:41Z","timestamp":1556573261000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016763779591591Z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,3]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,3]]}},"alternative-id":["016763779591591Z"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(95)91591-z","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1995,3]]}}}