{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T04:09:34Z","timestamp":1751688574436,"version":"3.41.0"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Scheduling"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1023\/a:1024840405535","type":"journal-article","created":{"date-parts":[[2003,9,16]],"date-time":"2003-09-16T19:30:35Z","timestamp":1063740635000},"page":"423-436","source":"Crossref","is-referenced-by-count":14,"title":["Task Allocation in a Multi-Server System"],"prefix":"10.1007","volume":"6","author":[{"given":"Sem","family":"Borst","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Onno","family":"Boxma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan Friso","family":"Groote","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sjouke","family":"Mauw","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5139388_CR1","unstructured":"Borst, S. C., O. J. Boxma, J. F. Groote, and S. Mauw, Task Allocation in a Multi-server System. CWI Report PNA-R0122, 2001."},{"key":"5139388_CR2","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1017\/S026996480000396X","volume":"9","author":"J. Bruno","year":"1995","unstructured":"Bruno, J., E. G. Coffman, and P. Downey, \u201cScheduling independent tasks to minimize the makespan on identical machines,\u201d Probability in the Engineering and Informational Sciences, 9, 447-456 (1995).","journal-title":"Probability in the Engineering and Informational Sciences"},{"key":"5139388_CR3","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/PL00008926","volume":"14","author":"B. S. Chlebus","year":"2001","unstructured":"Chlebus, B. S., R. De Prisco, and A. A. Shvartsman, \u201cPerforming tasks on synchronous restartable message-passing processors,\u201d Distributed Computing, 14, 49-64 (2001).","journal-title":"Distributed Computing"},{"key":"5139388_CR4","doi-asserted-by":"crossref","first-page":"1457","DOI":"10.1137\/S0097539793255527","volume":"27","author":"C. Dwork","year":"1998","unstructured":"Dwork, C., J. Y. Halpern, and O. Waarts, \u201cPerforming work efficiently in the presence of faults,\u201d SIAM Journal on Computing, 27, 1457-1491 (1998).","journal-title":"SIAM Journal on Computing"},{"volume-title":"The Grid: Blueprint for a New Computing Infrastructure","year":"1999","key":"5139388_CR5","unstructured":"Foster I. and C. Kesselman (ed.) The Grid: Blueprint for a New Computing Infrastructure, Morgan Kaufmann, San Fransisco, California, 1999."},{"key":"5139388_CR6","doi-asserted-by":"crossref","first-page":"1151","DOI":"10.1109\/71.888636","volume":"11","author":"B. Hamidzadeh","year":"2000","unstructured":"Hamidzadeh, B., L. Y. Kit, and D. J. Lilja, \u201cDynamic task scheduling using online optimization,\u201d IEEE Trans. Parallel Distributed Systems, 11, 1151-1163 (2000).","journal-title":"IEEE Trans. Parallel Distributed Systems"},{"issue":"2","key":"5139388_CR7","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1511\/1998.21.113","volume":"86","author":"B. Hayes","year":"1998","unstructured":"Hayes, B., \u201cCollective wisdom,\u201d The American Scientist, 86(2), 118-122 (1998).","journal-title":"The American Scientist"},{"key":"5139388_CR8","doi-asserted-by":"crossref","first-page":"1339","DOI":"10.1109\/12.895858","volume":"49","author":"T. Hsu","year":"2000","unstructured":"Hsu, T., J. C. Lee, D. R. Lopez, and W. A. Royce, \u201cTask allocation on a network of processors,\u201d IEEE Trans. on Comput., 49, 1339-1353 (2000).","journal-title":"IEEE Trans. on Comput."},{"key":"5139388_CR9","unstructured":"Kleinrock, L., Queueing Systems, Vol. 1: Theory. John Wiley & Sons, New York."},{"key":"5139388_CR10","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1109\/5992.895191","volume":"3","author":"E. Korpela","year":"2001","unstructured":"Korpela, E., D. Werthimer, D. Anderson, J. Cobb, and M. Lebofsky, \u201cSETI@home: Massively distributed computing for SETI,\u201d Comput. Sci. Eng., 3, 78-83 (2001).","journal-title":"Comput. Sci. Eng."},{"key":"5139388_CR11","volume-title":"Inequalities: Theory of Majorization and Its Applications","author":"A. W. Marshall","year":"1979","unstructured":"Marshall, A. W. and I. Olkin, Inequalities: Theory of Majorization and Its Applications. Academic Press, New York, 1979."},{"key":"5139388_CR12","volume-title":"Comparison Methods for Queues and Other Stochastic Models","author":"D. Stoyan","year":"1983","unstructured":"Stoyan, D., Comparison Methods for Queues and Other Stochastic Models. John Wiley & Sons, Chichester, 1983."},{"key":"5139388_CR13","unstructured":"Walrand, J., An Introduction to Queueing Networks. Prentice Hall, 1988."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1024840405535.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1024840405535\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1024840405535.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T13:00:37Z","timestamp":1751634037000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1024840405535"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":13,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["5139388"],"URL":"https:\/\/doi.org\/10.1023\/a:1024840405535","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"type":"print","value":"1094-6136"},{"type":"electronic","value":"1099-1425"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}