{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:49:49Z","timestamp":1742914189719,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642207112"},{"type":"electronic","value":"9783642207129"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20712-9_34","type":"book-chapter","created":{"date-parts":[[2011,6,11]],"date-time":"2011-06-11T04:05:22Z","timestamp":1307765122000},"page":"429-442","source":"Crossref","is-referenced-by-count":0,"title":["Improved Online Scheduling in Maximizing Throughput of Equal Length Jobs"],"prefix":"10.1007","author":[{"given":"Thang","family":"Nguyen Kim","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"34_CR1","doi-asserted-by":"crossref","unstructured":"Baruah, S.K., Haritsa, J., Sharma, N.: On-line scheduling to maximize task completions. In: Real-Time Systems Symposium, pp. 228\u2013236 (December 1994)","DOI":"10.1109\/REAL.1994.342713"},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"Chan, W.-T., Lam, T.W., Ting, H.-F., Wong, P.W.H.: New results on on-demand broadcasting with deadline via job scheduling with cancellation. In: Proc. 10th International on Computing and Combinatorics Conference, pp. 210\u2013218 (2004)","DOI":"10.1007\/978-3-540-27798-9_24"},{"key":"34_CR3","first-page":"21","volume-title":"Handbook of Combinatorial Optimization","author":"B. Chen","year":"1998","unstructured":"Chen, B., Potts, C.N., Woeginger, G.J.: A review of machine scheduling: Complexity, Algorithms and Approximability. In: Handbook of Combinatorial Optimization, vol.\u00a03, pp. 21\u2013169. Kluwer Academic Publishers, Dordrecht (1998)"},{"issue":"3","key":"34_CR4","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s00453-003-1025-6","volume":"37","author":"F.Y.L. Chin","year":"2003","unstructured":"Chin, F.Y.L., Fung, S.P.Y.: Online scheduling with partial job values: Does timesharing or randomization help? Algorithmica\u00a037(3), 149\u2013164 (2003)","journal-title":"Algorithmica"},{"issue":"6","key":"34_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 J. Comput.\u00a036(6), 1709\u20131728 (2007)","journal-title":"SIAM J. Comput."},{"key":"34_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/978-3-642-12450-1_11","volume-title":"Approximation and Online Algorithms","author":"C. D\u00fcrr","year":"2010","unstructured":"D\u00fcrr, C., Je\u017c, \u0141., Nguyen, K.T.: Online scheduling of bounded length jobs to maximize throughput. In: Bampis, E., Jansen, K. (eds.) WAOA 2009. LNCS, vol.\u00a05893, pp. 116\u2013127. Springer, Heidelberg (2010)"},{"key":"34_CR7","unstructured":"Englert, M., Westermann, M.: Considering suppressed packets improves buffer management in QoS switches. In: SODA 2007, pp. 209\u2013218. ACM\/SIAM (2007)"},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"Goldwasser, M.H.: A survey of buffer management policies for packet switches. SIGACT News\u00a041(1) (2010)","DOI":"10.1145\/1753171.1753195"},{"issue":"3","key":"34_CR9","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1016\/j.tcs.2004.02.047","volume":"325","author":"J.-H. Kim","year":"2004","unstructured":"Kim, J.-H., Chwa, K.-Y.: Scheduling broadcasts with deadlines. Theoretical Computer Science\u00a0325(3), 479\u2013488 (2004)","journal-title":"Theoretical Computer Science"},{"issue":"1-3","key":"34_CR10","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0304-3975(02)00407-3","volume":"295","author":"C.-Y. Koo","year":"2003","unstructured":"Koo, C.-Y., Lam, T.-W., Ngan, T.-W., Sadakane, K., To, K.-K.: On-line scheduling with tight deadlines. Theoretical Computer Science\u00a0295(1-3), 251\u2013261 (2003)","journal-title":"Theoretical Computer Science"},{"key":"34_CR11","doi-asserted-by":"crossref","DOI":"10.1201\/9780203489802","volume-title":"Handbook of Scheduling: Algorithms, Models, and Performance Analysis","author":"J. Leung","year":"2004","unstructured":"Leung, J., Kelly, L., Anderson, J.H.: Handbook of Scheduling: Algorithms, Models, and Performance Analysis. CRC Press, Boca Raton (2004)"},{"key":"34_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/11809678_34","volume-title":"Computing and Combinatorics","author":"F. Zheng","year":"2006","unstructured":"Zheng, F., Fung, S.P.Y., Chan, W.-T., Chin, F.Y.L., Poon, C.K., Wong, P.W.H.: Improved on-line broadcast scheduling with deadlines. In: Chen, D.Z., Lee, D.T. (eds.) COCOON 2006. LNCS, vol.\u00a04112, pp. 320\u2013329. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20712-9_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,25]],"date-time":"2021-11-25T00:48:40Z","timestamp":1637801320000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20712-9_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642207112","9783642207129"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20712-9_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}