{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T17:00:16Z","timestamp":1780765216389,"version":"3.54.1"},"reference-count":9,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2004,8,1]],"date-time":"2004-08-01T00:00:00Z","timestamp":1091318400000},"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":[[2004,8]]},"DOI":"10.1016\/s0377-2217(03)00243-1","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T15:12:00Z","timestamp":1062601920000},"page":"262-266","source":"Crossref","is-referenced-by-count":22,"title":["Makespan minimization on uniform parallel machines with release times"],"prefix":"10.1016","volume":"157","author":[{"given":"Christos","family":"Koulamas","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"George J","family":"Kyparisis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(03)00243-1_BIB1","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1016\/0377-2217(87)90243-8","article-title":"Scheduling jobs with release dates and tails on identical machines to minimize the makespan","volume":"29","author":"Carlier","year":"1987","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(03)00243-1_BIB2","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1137\/0209007","article-title":"Bounds for list schedules on uniform processors","volume":"9","author":"Cho","year":"1980","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0377-2217(03)00243-1_BIB3","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1016\/S0360-8352(98)00105-3","article-title":"Scheduling identical jobs with unequal ready times on uniform parallel machines to minimize the maximum lateness","volume":"4","author":"Dessouky","year":"1998","journal-title":"Computers and Industrial Engineering"},{"key":"10.1016\/S0377-2217(03)00243-1_BIB4","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0377-2217(03)00243-1_BIB5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0196-6774(84)90035-X","article-title":"Bounds for naive multiple machine scheduling with release times and deadlines","volume":"5","author":"Gusfield","year":"1984","journal-title":"Journal of Algorithms"},{"key":"10.1016\/S0377-2217(03)00243-1_BIB6","doi-asserted-by":"crossref","unstructured":"Hall, L.A., Shmoys, D.B., 1989. Approximation Schemes for Constrained Scheduling Problems. Proceedings of the 30th IEEE Symposium Foundations of Computer Science. pp. 134\u2013139","DOI":"10.1109\/SFCS.1989.63468"},{"key":"10.1016\/S0377-2217(03)00243-1_BIB7","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/S0167-6377(00)00018-3","article-title":"Scheduling on uniform parallel machines to minimize maximum lateness","volume":"26","author":"Koulamas","year":"2000","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(03)00243-1_BIB8","doi-asserted-by":"crossref","unstructured":"Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B., 1993. Sequencing and Scheduling: Algorithms and Complexity. in: Graves, S.C., Rinnooy Kan, A.H.G., Zipkin, P.H. (Eds.), Handbooks in Operations Research and Management Science, vol. 4: Logistics of Production and Inventory. North-Holland, Amsterdam, pp. 445\u2013522","DOI":"10.1016\/S0927-0507(05)80189-6"},{"key":"10.1016\/S0377-2217(03)00243-1_BIB9","series-title":"Scheduling Theory. Single-Stage Systems","author":"Tanaev","year":"1994"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221703002431?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221703002431?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,25]],"date-time":"2020-03-25T09:28:56Z","timestamp":1585128536000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221703002431"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,8]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,8]]}},"alternative-id":["S0377221703002431"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(03)00243-1","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2004,8]]}}}