{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T12:09:28Z","timestamp":1772021368722,"version":"3.50.1"},"reference-count":17,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2002,8,1]],"date-time":"2002-08-01T00:00:00Z","timestamp":1028160000000},"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":["Operations Research Letters"],"published-print":{"date-parts":[[2002,8]]},"DOI":"10.1016\/s0167-6377(02)00179-7","type":"journal-article","created":{"date-parts":[[2002,10,17]],"date-time":"2002-10-17T01:46:23Z","timestamp":1034819183000},"page":"269-275","source":"Crossref","is-referenced-by-count":34,"title":["Optimal preemptive semi-online scheduling to minimize makespan on two related machines"],"prefix":"10.1016","volume":"30","author":[{"given":"Leah","family":"Epstein","sequence":"first","affiliation":[]},{"given":"Lene M.","family":"Favrholdt","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(02)00179-7_BIB1","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0167-6377(95)00039-9","article-title":"An optimal algorithm for preemptive on-line scheduling","volume":"18","author":"Chen","year":"1995","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"10.1016\/S0167-6377(02)00179-7_BIB2","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1137\/0213044","article-title":"Scheduling independent tasks on uniform processors","volume":"13","author":"Dobson","year":"1984","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/S0167-6377(02)00179-7_BIB3","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/S0167-6377(01)00085-2","article-title":"Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios","volume":"29","author":"Epstein","year":"2001","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0167-6377(02)00179-7_BIB4","doi-asserted-by":"crossref","unstructured":"L. Epstein, L.M. Favrholdt, Optimal non-preemptive semi-online scheduling on two related machines, Proc. of the 27th International Symposium on Mathematical Foundations of Computer Science (MFCS2002), to appear.","DOI":"10.1007\/3-540-45687-2_20"},{"issue":"2","key":"10.1016\/S0167-6377(02)00179-7_BIB5","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1002\/jos.60","article-title":"Randomized online scheduling on two uniform machines","volume":"4","author":"Epstein","year":"2001","journal-title":"J. Scheduling"},{"issue":"1","key":"10.1016\/S0167-6377(02)00179-7_BIB6","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/S0167-6377(99)00062-0","article-title":"A lower bound for on-line scheduling on uniformly related machines","volume":"26","author":"Epstein","year":"2000","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"10.1016\/S0167-6377(02)00179-7_BIB7","doi-asserted-by":"crossref","first-page":"554","DOI":"10.1137\/0216037","article-title":"Tighter bounds for LPT scheduling on uniform processors","volume":"16","author":"Friesen","year":"1987","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/S0167-6377(02)00179-7_BIB8","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1137\/0222026","article-title":"An on-line scheduling heuristic with better worst case ratio than Graham's list scheduling","volume":"22","author":"Galambos","year":"1993","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0167-6377(02)00179-7_BIB9","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","article-title":"Bounds for certain multiprocessor anomalies","volume":"45","author":"Graham","year":"1966","journal-title":"Bell Syst. Tech. J."},{"key":"10.1016\/S0167-6377(02)00179-7_BIB10","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0117039","article-title":"Bounds on multiprocessing timing anomalies","volume":"17","author":"Graham","year":"1969","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0167-6377(02)00179-7_BIB11","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1145\/321992.321995","article-title":"A level algorithm for preemptive scheduling","volume":"24","author":"Horwath","year":"1977","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0167-6377(02)00179-7_BIB12","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1287\/opre.45.1.116","article-title":"A parametric worst case analysis of the LPT heuristic for two uniform machines","volume":"45","author":"Mireault","year":"1997","journal-title":"Oper. Res."},{"issue":"1\u20132","key":"10.1016\/S0167-6377(02)00179-7_BIB13","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1016\/S0304-3975(00)00288-7","article-title":"Preemptive multiprocessor scheduling with rejection","volume":"262","author":"Seiden","year":"2001","journal-title":"Theoret. Comput. Sci."},{"issue":"5","key":"10.1016\/S0167-6377(02)00179-7_BIB14","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/S0167-6377(00)00053-5","article-title":"Semi-online scheduling with decreasing job sizes","volume":"27","author":"Seiden","year":"2000","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"10.1016\/S0167-6377(02)00179-7_BIB15","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/S0020-0190(97)00093-8","article-title":"A lower bound for randomized on-line multiprocessor scheduling","volume":"63","author":"Sgall","year":"1997","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/S0167-6377(02)00179-7_BIB16","series-title":"Online Algorithms: The State of the Art","first-page":"196","article-title":"On-line scheduling","volume":"Vol. 1442","author":"Sgall","year":"1998"},{"key":"10.1016\/S0167-6377(02)00179-7_BIB17","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/S0167-6377(98)00032-7","article-title":"Preemptive on-line scheduling for two uniform processors","volume":"23","author":"Wen","year":"1998","journal-title":"Oper. Res. Lett."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637702001797?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637702001797?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,7]],"date-time":"2019-04-07T10:51:25Z","timestamp":1554634285000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637702001797"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,8]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2002,8]]}},"alternative-id":["S0167637702001797"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(02)00179-7","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2002,8]]}}}