{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,25]],"date-time":"2024-06-25T09:07:58Z","timestamp":1719306478243},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,5,4]],"date-time":"2010-05-04T00:00:00Z","timestamp":1272931200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2011,2]]},"DOI":"10.1007\/s10951-010-0177-x","type":"journal-article","created":{"date-parts":[[2010,5,3]],"date-time":"2010-05-03T16:39:38Z","timestamp":1272904778000},"page":"89-101","source":"Crossref","is-referenced-by-count":6,"title":["Competitive ratio of List Scheduling on uniform machines and\u00a0randomized heuristics"],"prefix":"10.1007","volume":"14","author":[{"given":"Antoine","family":"Musitelli","sequence":"first","affiliation":[]},{"given":"Jean-Marc","family":"Nicoletti","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,5,4]]},"reference":[{"issue":"3","key":"177_CR1","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1006\/jcss.1995.1074","volume":"51","author":"Y. Bartal","year":"1995","unstructured":"Bartal, Y., Fiat, A., Karloff, H., & Vohra, R. (1995). New algorithms for an ancient scheduling problem. Journal of Computer and System Sciences, 51(3), 359\u2013366.","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"177_CR2","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1006\/jcss.1995.1021","volume":"50","author":"A. Borodin","year":"1995","unstructured":"Borodin, A., Irani, S., Raghavan, P., & Schieber, B. (1995). Competitive paging with locality of reference. Journal of Computer and System Sciences, 50(2), 244\u2013258.","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"177_CR3","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1016\/j.ipl.2006.02.012","volume":"99","author":"T. C. E. Cheng","year":"2006","unstructured":"Cheng, T. C. E., Ng, C. T., & Kotov, V. (2006). A new algorithm for online uniform-machine scheduling to minimize the makespan. Information Processing Letters, 99(3), 102\u2013105.","journal-title":"Information Processing Letters"},{"issue":"1","key":"177_CR4","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1137\/0209007","volume":"9","author":"Y. Cho","year":"1980","unstructured":"Cho, Y., & Sahni, S. (1980). Bounds for list schedules on uniform processors. SIAM Journal on Computing, 9(1), 91\u2013103.","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"177_CR5","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1002\/jos.60","volume":"4","author":"L. Epstein","year":"2001","unstructured":"Epstein, L., Noga, J., Seiden, S., Sgall, J., & Woeginger, G. (2001). Randomized on-line scheduling on two uniform machines. Journal of Scheduling, 4(2), 71\u201392.","journal-title":"Journal of Scheduling"},{"key":"177_CR6","volume-title":"Approximation algorithms for NP-hard problems","author":"D. S. Hochbaum","year":"1997","unstructured":"Hochbaum, D. S. (1997). Approximation algorithms for NP-hard problems. Boston: PWS Publishing Company."},{"key":"177_CR7","unstructured":"Kokash, N. (2004). An efficient heuristic for on-line scheduling in system with one fast machine. Master Thesis."},{"issue":"2","key":"177_CR8","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1137\/S0097539799527969","volume":"27","author":"R. Li","year":"1998","unstructured":"Li, R., & Shi, L. (1998). An on-line algorithm for some uniform processor scheduling. SIAM Journal on Computing, 27(2), 414\u2013422.","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"177_CR9","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/s004530010014","volume":"28","author":"S. S. Seiden","year":"2000","unstructured":"Seiden, S. S. (2000). Randomized online multiprocessor scheduling. Algorithmica, 28(2), 173\u2013216.","journal-title":"Algorithmica"},{"key":"177_CR10","unstructured":"Sgall, J. (1994). On-line scheduling on parallel machines. Ph.D. Thesis, Carnegie-Mellon University, Pittsburgh, PA."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-010-0177-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-010-0177-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-010-0177-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T05:39:44Z","timestamp":1559453984000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-010-0177-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5,4]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,2]]}},"alternative-id":["177"],"URL":"https:\/\/doi.org\/10.1007\/s10951-010-0177-x","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,5,4]]}}}