{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,12]],"date-time":"2023-09-12T15:00:16Z","timestamp":1694530816513},"reference-count":9,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1016\/s0377-2217(02)00770-1","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T13:32:55Z","timestamp":1053351175000},"page":"404-416","source":"Crossref","is-referenced-by-count":6,"title":["An iterative algorithm for scheduling UET tasks with due dates and release times"],"prefix":"10.1016","volume":"149","author":[{"given":"Yakov","family":"Zinder","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(02)00770-1_BIB1","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1137\/S0097539790181889","article-title":"A new insight into the Coffman\u2013Graham algorithm","volume":"23","author":"Braschi","year":"1994","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0377-2217(02)00770-1_BIB2","series-title":"Scheduling Algorithms","author":"Brucker","year":"2001"},{"key":"10.1016\/S0377-2217(02)00770-1_BIB3","series-title":"Handbook of Combinatorial Optimisation","first-page":"21","article-title":"A review of machine scheduling: Complexity, algorithms and approximability","author":"Chen","year":"1998"},{"key":"10.1016\/S0377-2217(02)00770-1_BIB4","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1145\/321958.321967","article-title":"Scheduling tasks with nonuniform deadlines on two processors","volume":"23","author":"Garey","year":"1976","journal-title":"Journal of the Association for Computing Machinery"},{"key":"10.1016\/S0377-2217(02)00770-1_BIB5","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0206029","article-title":"Two-processor scheduling with start-time and deadlines","volume":"6","author":"Garey","year":"1977","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0377-2217(02)00770-1_BIB6","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1137\/0206037","article-title":"Worst case analysis of two scheduling algorithms","volume":"6","author":"Lam","year":"1977","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0377-2217(02)00770-1_BIB7","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1016\/S0022-0000(75)80008-0","article-title":"NP-complete scheduling problems","volume":"10","author":"Ullman","year":"1975","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/S0377-2217(02)00770-1_BIB8","unstructured":"Y. Zinder, G. Singh, Preemptive scheduling on parallel processors with due dates. Research report 02-01, Department of Mathematical Sciences, University of Technology, Sydney, 2002"},{"key":"10.1016\/S0377-2217(02)00770-1_BIB9","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1023\/A:1018917426360","article-title":"An iterative algorithm for scheduling unit-time operations with precedence constraints to minimise the maximum lateness","volume":"81","author":"Zinder","year":"1998","journal-title":"Annals of Operations Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702007701?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702007701?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T02:57:02Z","timestamp":1553914622000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702007701"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0377221702007701"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00770-1","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}