{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:29:43Z","timestamp":1759667383044},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2015,4,25]],"date-time":"2015-04-25T00:00:00Z","timestamp":1429920000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s10951-015-0430-4","type":"journal-article","created":{"date-parts":[[2015,4,24]],"date-time":"2015-04-24T05:31:37Z","timestamp":1429853497000},"page":"623-630","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["An efficient algorithm for semi-online multiprocessor scheduling with given total processing time"],"prefix":"10.1007","volume":"18","author":[{"given":"Hans","family":"Kellerer","sequence":"first","affiliation":[]},{"given":"Vladimir","family":"Kotov","sequence":"additional","affiliation":[]},{"given":"Micha\u00ebl","family":"Gabay","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,25]]},"reference":[{"key":"430_CR1","doi-asserted-by":"crossref","unstructured":"Albers, S. (2013). Recent advances for a classical scheduling problem, In Automata, languages and processing, Lecture Notes in Computer Science (Vol. 7966, pp. 4\u201314). Berlin: Springer.","DOI":"10.1007\/978-3-642-39212-2_2"},{"key":"430_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2012.03.031","volume":"443","author":"S Albers","year":"2012","unstructured":"Albers, S., & Hellwig, M. (2012). Semi-online scheduling revisited. Theoretical Computer Science, 443, 1\u20139.","journal-title":"Theoretical Computer Science"},{"key":"430_CR3","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1023\/B:JOSH.0000046074.03560.5d","volume":"7","author":"E Angelelli","year":"2004","unstructured":"Angelelli, E., Nagy, A. B., Speranza, M. G., & Tuza, Z. (2004). The on-line multiprocessor scheduling problem with known sum of the tasks. Journal of Scheduling, 7, 421\u2013428.","journal-title":"Journal of Scheduling"},{"key":"430_CR4","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/S0304-3975(00)00258-9","volume":"268","author":"Y Azar","year":"2001","unstructured":"Azar, Y., & Regev, O. (2001). On-line bin-stretching. Theoretical Computer Science, 268, 17\u201341.","journal-title":"Theoretical Computer Science"},{"key":"430_CR5","doi-asserted-by":"crossref","unstructured":"B\u00f6hm, M., Sgall, J., van Stee, R., & Vesel\u00fd, P. (2015). Better algorithms for online bin stretching. In Approximation and Online Algorithms, Lecture Notes of Computer Science (Vol. 8952).","DOI":"10.1007\/978-3-319-18263-6_3"},{"key":"430_CR6","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/j.tcs.2004.11.018","volume":"337","author":"TCE Cheng","year":"2005","unstructured":"Cheng, T. C. E., Kellerer, H., & Kotov, V. (2005). Semi-on-line multiprocessor scheduling with given total processing time. Theoretical Computer Science, 337, 134\u2013146.","journal-title":"Theoretical Computer Science"},{"key":"430_CR7","first-page":"107","volume":"9","author":"U Faigle","year":"1989","unstructured":"Faigle, U., Kern, W., & Turan, G. (1989). On the performance of on-line algorithms for partition problems. Acta Cybernetica, 9, 107\u2013119.","journal-title":"Acta Cybernetica"},{"key":"430_CR8","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1002\/1099-1425(200011\/12)3:6<343::AID-JOS54>3.0.CO;2-2","volume":"3","author":"R Fleischer","year":"2000","unstructured":"Fleischer, R., & Wahl, M. (2000). On-line scheduling revisited. Journal of Scheduling, 3, 343\u2013353.","journal-title":"Journal of Scheduling"},{"key":"430_CR9","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"RL Graham","year":"1966","unstructured":"Graham, R. L. (1966). Bounds for certain multiprocessor anomalies. Bell System Technical Journal, 45, 1563\u20131581.","journal-title":"Bell System Technical Journal"},{"key":"430_CR10","first-page":"263","volume":"17","author":"RL Graham","year":"1969","unstructured":"Graham, R. L. (1969). Bounds on multiprocessing timing anomalies. SIAM Journal of Applied Mathematics, 17, 263\u2013269.","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"430_CR11","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1145\/7531.7535","volume":"34","author":"DS Hochbaum","year":"1987","unstructured":"Hochbaum, D. S., & Shmoys, D. B. (1987). Using dual approximation algorithms for scheduling problems: theoretical and practical results. Journal of the ACM, 34, 144\u2013162.","journal-title":"Journal of the ACM"},{"key":"430_CR12","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/j.orl.2013.03.005","volume":"41","author":"H Kellerer","year":"2013","unstructured":"Kellerer, H., & Kotov, V. (2013). An efficient algorithm for bin stretching. Operations Research Letters, 41, 343\u2013346.","journal-title":"Operations Research Letters"},{"key":"430_CR13","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/S0167-6377(98)00005-4","volume":"21","author":"H Kellerer","year":"1997","unstructured":"Kellerer, H., Kotov, V., Speranza, M. G., & Tuza, Z. (1997). Semi on-line algorithms for the partition problem. Operations Research Letters, 21, 235\u2013242.","journal-title":"Operations Research Letters"},{"key":"430_CR14","unstructured":"Rudin, III J. F. (2001). Improved bounds for the on-line scheduling problem. Ph.D. thesis, University of Texas"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-015-0430-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-015-0430-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-015-0430-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:51Z","timestamp":1559468391000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-015-0430-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,25]]},"references-count":14,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["430"],"URL":"https:\/\/doi.org\/10.1007\/s10951-015-0430-4","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4,25]]}}}