{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T11:22:30Z","timestamp":1648725750645},"reference-count":2,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3735,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,6]]},"DOI":"10.1016\/s0304-3975(03)00141-5","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T23:53:40Z","timestamp":1051142020000},"page":"489-495","source":"Crossref","is-referenced-by-count":0,"title":["On polynomial-time approximation algorithms for the variable length scheduling problem"],"prefix":"10.1016","volume":"302","author":[{"given":"Artur","family":"Czumaj","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leszek","family":"Ga\u0327sieniec","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daya Ram","family":"Gaur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ramesh","family":"Krishnamurti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wojciech","family":"Rytter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michele","family":"Zito","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(03)00141-5_BIB1","doi-asserted-by":"crossref","first-page":"2037","DOI":"10.1016\/S0304-3975(02)00091-9","article-title":"Approximate sequencing for variable length tasks","volume":"290","author":"Cai","year":"2003","journal-title":"Theoret. Comput. Sci."},{"issue":"1\u20132","key":"10.1016\/S0304-3975(03)00141-5_BIB2","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1016\/S0304-3975(00)00366-2","article-title":"Efficient web searching using temporal factors","volume":"262","author":"Czumaj","year":"2001","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503001415?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503001415?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T01:21:16Z","timestamp":1553217676000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397503001415"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":2,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,6]]}},"alternative-id":["S0304397503001415"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(03)00141-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,6]]}}}