{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,14]],"date-time":"2025-04-14T10:43:08Z","timestamp":1744627388311},"reference-count":11,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"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,7]]},"DOI":"10.1016\/s0377-2217(02)00374-0","type":"journal-article","created":{"date-parts":[[2003,3,25]],"date-time":"2003-03-25T22:25:53Z","timestamp":1048631153000},"page":"205-210","source":"Crossref","is-referenced-by-count":7,"title":["Preemptive scheduling on identical parallel machines subject to deadlines"],"prefix":"10.1016","volume":"148","author":[{"given":"Meral","family":"Azizo\u011flu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(02)00374-0_BIB1","series-title":"Introduction to Sequencing and Scheduling","author":"Baker","year":"1974"},{"key":"10.1016\/S0377-2217(02)00374-0_BIB2","series-title":"Scheduling Algorithms","author":"Brucker","year":"1998"},{"key":"10.1016\/S0377-2217(02)00374-0_BIB3","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/361011.361064","article-title":"Scheduling independent tasks to reduce mean finishing time","volume":"17","author":"Bruno","year":"1974","journal-title":"Communications of the ACM"},{"key":"10.1016\/S0377-2217(02)00374-0_BIB4","series-title":"Theory of Scheduling","author":"Conway","year":"1967"},{"key":"10.1016\/S0377-2217(02)00374-0_BIB5","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/0304-3975(90)90100-V","article-title":"Minimizing mean flow time with release time constraint","volume":"75","author":"Du","year":"1990","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S0377-2217(02)00374-0_BIB6","series-title":"Computers and Intractability\u2013\u2013A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0377-2217(02)00374-0_BIB7","series-title":"Optimal Mean Finish Time Preemptive Schedules","author":"Gonzalez","year":"1977"},{"key":"10.1016\/S0377-2217(02)00374-0_BIB8","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1287\/opre.38.3.487","article-title":"Preemptive scheduling of equal length jobs on two machines to minimize mean flow time","volume":"38","author":"Heerbach","year":"1990","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(02)00374-0_BIB9","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","article-title":"Complexity of machine scheduling problems","volume":"1","author":"Lenstra","year":"1977","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/S0377-2217(02)00374-0_BIB10","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0020-0190(90)90229-Q","article-title":"Preemptive scheduling of to minimize mean weighted flow time","volume":"34","author":"Leung","year":"1990","journal-title":"Information Processing Letter"},{"key":"10.1016\/S0377-2217(02)00374-0_BIB11","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/nav.3800030106","article-title":"Various optimizers for single stage production","volume":"3","author":"Smith","year":"1956","journal-title":"Naval Research Logistics Quarterly"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702003740?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702003740?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T02:57:22Z","timestamp":1554778642000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702003740"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,7]]}},"alternative-id":["S0377221702003740"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00374-0","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2003,7]]}}}