{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:44:53Z","timestamp":1743122693710,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540440406"},{"type":"electronic","value":"9783540456872"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45687-2_20","type":"book-chapter","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T08:57:47Z","timestamp":1192784267000},"page":"245-256","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Optimal Non-preemptive Semi-online Scheduling on Two Related Machines"],"prefix":"10.1007","author":[{"given":"Leah","family":"Epstein","sequence":"first","affiliation":[]},{"given":"Lene M.","family":"Favrholdt","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,10,4]]},"reference":[{"issue":"1","key":"20_CR1","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1137\/0209007","volume":"9","author":"Y. Cho","year":"1980","unstructured":"Y. Cho and S. Sahni. Bounds for List Schedules on Uniform Processors. SIAM Journal on Computing, 9(1):91\u2013103, 1980.","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"20_CR2","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1137\/0213044","volume":"13","author":"G. Dobson","year":"1984","unstructured":"G. Dobson. Scheduling Independent Tasks on Uniform Processors. SIAM Journal on Computing, 13(4):705\u2013716, 1984.","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"20_CR3","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1002\/jos.60","volume":"4","author":"L. Epstein","year":"2001","unstructured":"L. Epstein, J. Noga, S. S. Seiden, J. Sgall, and G. J. Woeginger. Randomized Online Scheduling on Two Uniform Machines. Journal of Scheduling, 4(2):71\u201392, 2001.","journal-title":"Journal of Scheduling"},{"issue":"3","key":"20_CR4","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1137\/0216037","volume":"16","author":"D. K. Friesen","year":"1987","unstructured":"D. K. Friesen. Tighter Bounds for LPT Scheduling on Uniform Processors. SIAM Journal on Computing, 16(3):554\u2013560, 1987.","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"20_CR5","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1137\/0206013","volume":"6","author":"T. Gonzalez","year":"1977","unstructured":"T. Gonzalez, O. H. Ibarra, and S. Sahni. Bounds for LPT Schedules on Uniform Processors. SIAM Journal on Computing, 6(1):155\u2013166, 1977.","journal-title":"SIAM Journal on Computing"},{"key":"20_CR6","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"R. L. Graham","year":"1969","unstructured":"R. L. Graham. Bounds on Multiprocessing Timing Anomalies. SIAM J. Appl. Math, 17:416\u2013429, 1969.","journal-title":"SIAM J. Appl. Math"},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1287\/opre.45.1.116","volume":"45","author":"P. Mireault","year":"1997","unstructured":"P. Mireault, J. B. Orlin, and R. V. Vohra. A Parametric Worst Case Analysis of the LPT Heuristic for Two Uniform Machines. Operations Research, 45:116\u2013125, 1997.","journal-title":"Operations Research"},{"issue":"5","key":"20_CR8","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0167-6377(00)00053-5","volume":"27","author":"S. Seiden","year":"2000","unstructured":"S. Seiden, J. Sgall, and G. J. Woeginger. Semi-Online Scheduling with Decreasing Job Sizes. Operations Research Letters, 27(5):215\u2013221, 2000.","journal-title":"Operations Research Letters"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2002"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45687-2_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,23]],"date-time":"2023-01-23T20:29:24Z","timestamp":1674505764000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-45687-2_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440406","9783540456872"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-45687-2_20","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"4 October 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}