{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,7]],"date-time":"2026-06-07T04:17:51Z","timestamp":1780805871768,"version":"3.54.1"},"reference-count":7,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2003,8,1]],"date-time":"2003-08-01T00:00:00Z","timestamp":1059696000000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[2003,8]]},"DOI":"10.1016\/s0020-0190(03)00272-2","type":"journal-article","created":{"date-parts":[[2003,6,2]],"date-time":"2003-06-02T19:15:45Z","timestamp":1054581345000},"page":"213-217","source":"Crossref","is-referenced-by-count":2,"title":["Complexity of min\u2013max subsequence problems"],"prefix":"10.1016","volume":"87","author":[{"given":"Wil","family":"Michiels","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jan","family":"Korst","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0020-0190(03)00272-2_BIB001","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/(SICI)1099-1425(199806)1:1<55::AID-JOS2>3.0.CO;2-J","article-title":"Approximation schemes for scheduling on parallel machines","volume":"1","author":"Alon","year":"1998","journal-title":"J. Scheduling"},{"key":"10.1016\/S0020-0190(03)00272-2_BIB002","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1016\/S0925-5273(98)00164-9","article-title":"A turbine-blade balancing problem","volume":"60\u201361","author":"Choi","year":"1999","journal-title":"Internat. J. Production Econ."},{"key":"10.1016\/S0020-0190(03)00272-2_BIB003","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1145\/7531.7535","article-title":"Using dual approximation algorithms for scheduling problems: Theoretical and practical results","volume":"34","author":"Hochbaum","year":"1987","journal-title":"J. ACM"},{"issue":"6","key":"10.1016\/S0020-0190(03)00272-2_BIB004","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0167-6377(86)90026-X","article-title":"Cyclic scheduling of offweekends","volume":"4","author":"Koop","year":"1986","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0020-0190(03)00272-2_BIB005","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/moor.8.4.538","article-title":"Integer programming with a fixed number of variables","volume":"8","author":"Lenstra","year":"1983","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0020-0190(03)00272-2_BIB006","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0166-218X(94)90214-3","article-title":"Some complexity results about threshold graphs","volume":"49","author":"Margot","year":"1994","journal-title":"Discrete Appl. Math."},{"issue":"5","key":"10.1016\/S0020-0190(03)00272-2_BIB007","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1002\/jos.80","article-title":"Min\u2013max subsequence problems in multi-zone disk recording","volume":"4","author":"Michiels","year":"2001","journal-title":"J. Scheduling"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019003002722?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019003002722?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T19:56:19Z","timestamp":1553111779000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019003002722"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,8]]},"references-count":7,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,8]]}},"alternative-id":["S0020019003002722"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(03)00272-2","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2003,8]]}}}