{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:47:05Z","timestamp":1725558425947},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642137303"},{"type":"electronic","value":"9783642137310"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13731-0_33","type":"book-chapter","created":{"date-parts":[[2010,6,10]],"date-time":"2010-06-10T11:00:50Z","timestamp":1276167650000},"page":"346-358","source":"Crossref","is-referenced-by-count":1,"title":["Dispatching Equal-Length Jobs to Parallel Machines to Maximize Throughput"],"prefix":"10.1007","author":[{"given":"David P.","family":"Bunde","sequence":"first","affiliation":[]},{"given":"Michael H.","family":"Goldwasser","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"33_CR1","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s00453-006-0193-6","volume":"47","author":"N. Avrahami","year":"2007","unstructured":"Avrahami, N., Azar, Y.: Minimizing total flow time and total completion time with immediate dispatching. Algorithmica\u00a047(3), 253\u2013268 (2007)","journal-title":"Algorithmica"},{"key":"33_CR2","first-page":"65","volume":"39","author":"S.K. Baruah","year":"2001","unstructured":"Baruah, S.K., Haritsa, J.R., Sharma, N.: On-line scheduling to maximize task completions. J. Combin. Math. and Combin. Computing\u00a039, 65\u201378 (2001)","journal-title":"J. Combin. Math. and Combin. Computing"},{"key":"33_CR3","volume-title":"Online Computation and Competitive Analysis","author":"A. Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, New York (1998)"},{"issue":"2","key":"33_CR4","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.jda.2005.03.005","volume":"4","author":"F.Y.L. Chin","year":"2006","unstructured":"Chin, F.Y.L., Chrobak, M., Fung, S.P.Y., Jawor, W., Sgall, J., Tich\u00fd, T.: Online competitive algorithms for maximizing weighted throughput of unit jobs. J. Discrete Algorithms\u00a04(2), 255\u2013276 (2006)","journal-title":"J. Discrete Algorithms"},{"issue":"6","key":"33_CR5","doi-asserted-by":"publisher","first-page":"1709","DOI":"10.1137\/S0097539704446608","volume":"36","author":"M. Chrobak","year":"2007","unstructured":"Chrobak, M., Jawor, W., Sgall, J., Tich\u00fd, T.: Online scheduling of equal-length jobs: Randomization and restarts help. SIAM Journal on Computing\u00a036(6), 1709\u20131728 (2007)","journal-title":"SIAM Journal on Computing"},{"key":"33_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/978-3-540-75520-3_39","volume-title":"Algorithms \u2013 ESA 2007","author":"J. Ding","year":"2007","unstructured":"Ding, J., Ebenlendr, T., Sgall, J., Zhang, G.: Online scheduling of equal-length jobs on parallel machines. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol.\u00a04698, pp. 427\u2013438. Springer, Heidelberg (2007)"},{"key":"33_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/11775096_5","volume-title":"Algorithmic Aspects in Information and Management","author":"J. Ding","year":"2006","unstructured":"Ding, J., Zhang, G.: Online scheduling with hard deadlines on parallel machines. In: Cheng, S.-W., Poon, C.K. (eds.) AAIM 2006. LNCS, vol.\u00a04041, pp. 32\u201342. Springer, Heidelberg (2006)"},{"key":"33_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-540-93980-1_4","volume-title":"Approximation and Online Algorithms","author":"T. Ebenlendr","year":"2009","unstructured":"Ebenlendr, T., Sgall, J.: A lower bound for scheduling of unit jobs with immediate decision on parallel machines. In: Bampis, E., Skutella, M. (eds.) WAOA 2008. LNCS, vol.\u00a05426, pp. 43\u201352. Springer, Heidelberg (2009)"},{"issue":"2","key":"33_CR9","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1006\/jagm.1999.1060","volume":"34","author":"S. Goldman","year":"2000","unstructured":"Goldman, S., Parwatikar, J., Suri, S.: On-line scheduling with hard deadlines. J. Algorithms\u00a034(2), 370\u2013389 (2000)","journal-title":"J. Algorithms"},{"issue":"3","key":"33_CR10","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1023\/A:1022956425198","volume":"6","author":"M.H. Goldwasser","year":"2003","unstructured":"Goldwasser, M.H., Kerbikov, B.: Admission control with immediate notification. J. Scheduling\u00a06(3), 269\u2013285 (2003)","journal-title":"J. Scheduling"},{"issue":"6","key":"33_CR11","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1016\/j.ipl.2008.03.003","volume":"107","author":"M.H. Goldwasser","year":"2008","unstructured":"Goldwasser, M.H., Misra, A.B.: A simpler competitive analysis for scheduling equal-length jobs on one machine with restarts. Information Processing Letters\u00a0107(6), 240\u2013245 (2008)","journal-title":"Information Processing Letters"},{"doi-asserted-by":"crossref","unstructured":"Goldwasser, M.H., Pedigo, M.: Online nonpreemptive scheduling of equal-length jobs on two identical machines. ACM Trans. on Algorithms\u00a05(1), 18, Article\u00a02 (2008)","key":"33_CR12","DOI":"10.1145\/1435375.1435377"},{"issue":"1","key":"33_CR13","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/BF01762111","volume":"3","author":"A. Karlin","year":"1988","unstructured":"Karlin, A., Manasse, M., Rudolph, L., Sleator, D.: Competitive snoopy paging. Algorithmica\u00a03(1), 70\u2013119 (1988)","journal-title":"Algorithmica"},{"issue":"4","key":"33_CR14","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1145\/1243401.1243411","volume":"34","author":"K. Pruhs","year":"2007","unstructured":"Pruhs, K.: Competitive online scheduling for server systems. SIGMETRICS Perform. Eval. Rev.\u00a034(4), 52\u201358 (2007)","journal-title":"SIGMETRICS Perform. Eval. Rev."},{"key":"33_CR15","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D. Sleator","year":"1985","unstructured":"Sleator, D., Tarjan, R.: Amortized efficiency of list update and paging rules. Communications of the ACM\u00a028, 202\u2013208 (1985)","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory - SWAT 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13731-0_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:42:24Z","timestamp":1606185744000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13731-0_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642137303","9783642137310"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13731-0_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}