{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:09:25Z","timestamp":1759666165433},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"4-5","license":[{"start":{"date-parts":[[2007,7,13]],"date-time":"2007-07-13T00:00:00Z","timestamp":1184284800000},"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":[[2007,9,24]]},"DOI":"10.1007\/s10951-007-0023-y","type":"journal-article","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T19:39:44Z","timestamp":1184614784000},"page":"263-269","source":"Crossref","is-referenced-by-count":9,"title":["Semi on-line scheduling on three processors with known sum of\u00a0the tasks"],"prefix":"10.1007","volume":"10","author":[{"given":"Enrico","family":"Angelelli","sequence":"first","affiliation":[]},{"given":"Maria Grazia","family":"Speranza","sequence":"additional","affiliation":[]},{"given":"Zsolt","family":"Tuza","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,7,13]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1137\/S0097539797324874","volume":"29","author":"S. Albers","year":"1999","unstructured":"Albers, S. (1999). Better bounds for online scheduling. SIAM Journal on Computing, 29, 459\u2013473.","journal-title":"SIAM Journal on Computing"},{"key":"23_CR2","first-page":"285","volume":"8","author":"E. Angelelli","year":"2000","unstructured":"Angelelli, E. (2000). Semi on-line scheduling on two parallel processors with known sum and lower bound on the size of the tasks. Central European Journal of Operations Research, 8, 285\u2013295.","journal-title":"Central European Journal of Operations Research"},{"key":"23_CR3","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/s00453-003-1037-2","volume":"37","author":"E. Angelelli","year":"2003","unstructured":"Angelelli, E., Speranza, M. G., & Tuza, Zs. (2003). Semi on-line scheduling on two parallel processors with upper bound on the items. Algorithmica, 37, 243\u2013262.","journal-title":"Algorithmica"},{"key":"23_CR4","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., Speranza, M. G., & Tuza, Zs. (2004). Semi on-line multiprocessor scheduling with known sum of the tasks. Journal of Scheduling, 7, 421\u2013428.","journal-title":"Journal of Scheduling"},{"key":"23_CR5","first-page":"107","volume":"9","author":"U. Faigle","year":"1989","unstructured":"Faigle, U., Kern, W., & Tur\u00e1n, Gy. (1989). On the performance of on-line algorithms for particular problems. Acta Cybernetica, 9, 107\u2013119.","journal-title":"Acta Cybernetica"},{"key":"23_CR6","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":"23_CR7","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"R. L. Graham","year":"1966","unstructured":"Graham, R. L. (1966). Bounds for certain multiprocessing anomalies. Bell System Technical Journal, 45, 1563\u20131581.","journal-title":"Bell System Technical Journal"},{"key":"23_CR8","first-page":"263","volume":"17","author":"R. L. Graham","year":"1969","unstructured":"Graham, R. L. (1969). Bounds on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics, 17, 263\u2013269.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"23_CR9","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/s006070050020","volume":"62","author":"Y. He","year":"1999","unstructured":"He, Y., & Zhang, G. (1999). Semi on-line scheduling on two identical machines. Computing, 62, 179\u2013187.","journal-title":"Computing"},{"key":"23_CR10","first-page":"181","volume-title":"Annotated bibliographies in combinatorial optimization","author":"J. A. Hoogeveen","year":"1997","unstructured":"Hoogeveen, J. A., Lenstra, J. K., & van de Velde, S. L. (1997). Sequencing and scheduling. In M. Dell\u2019Amico, F. Maffioli, & S. Martello (Eds.), Annotated bibliographies in combinatorial optimization (pp. 181\u2013197). New York: Wiley."},{"key":"23_CR11","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, Zs. (1997). Semi on-line algorithms for the partition problem. Operations Research Letters, 21, 235\u2013242.","journal-title":"Operations Research Letters"},{"key":"23_CR12","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/BFb0029570","volume-title":"On-line algorithms: the state of the art","author":"J. Sgall","year":"1998","unstructured":"Sgall, J. (1998). On-line scheduling. In A. Fiat & G. J. Woeginger (Eds.), Lecture notes in computer science : Vol. 1442. On-line algorithms: the state of the art (pp. 196\u2013231). Berlin: Springer."},{"key":"23_CR13","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D. Sleator","year":"1985","unstructured":"Sleator, D., & Tarjan, R. E. (1985). Amortized efficiency of list update and paging rules. Communications of ACM, 28, 202\u2013208.","journal-title":"Communications of ACM"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-007-0023-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-007-0023-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-007-0023-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T05:39:39Z","timestamp":1559453979000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-007-0023-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,7,13]]},"references-count":13,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[2007,9,24]]}},"alternative-id":["23"],"URL":"https:\/\/doi.org\/10.1007\/s10951-007-0023-y","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,7,13]]}}}