{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:55:49Z","timestamp":1742950549623,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540939795"},{"type":"electronic","value":"9783540939801"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-540-93980-1_5","type":"book-chapter","created":{"date-parts":[[2009,1,12]],"date-time":"2009-01-12T05:12:21Z","timestamp":1231737141000},"page":"53-66","source":"Crossref","is-referenced-by-count":7,"title":["Improved Randomized Online Scheduling of Unit Length Intervals and Jobs"],"prefix":"10.1007","author":[{"given":"Stanley P. Y.","family":"Fung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chung Keung","family":"Poon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feifeng","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Albers, S.: On randomized online scheduling. In: Proc. 34th ACM Symposium on Theory of Computing, pp. 134\u2013143 (2002)","DOI":"10.1145\/509907.509930"},{"key":"5_CR2","unstructured":"Awerbuch, B., Bartal, Y., Fiat, A., Rosen, A.: Competitive non-preemptive call control. In: Proc. 5th ACM-SIAM Symposium on Discrete Algorithms, pp. 312\u2013320 (1994)"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/BF00365406","volume":"4","author":"S. Baruah","year":"1992","unstructured":"Baruah, S., Koren, G., Mao, D., Mishra, B., Raghunathan, A., Rosier, L., Shasha, D., Wang, F.: On the competitiveness of on-line real-time task scheduling. Real-Time Systems\u00a04, 125\u2013144 (1992)","journal-title":"Real-Time Systems"},{"key":"5_CR4","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":"4","key":"5_CR5","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1137\/S0097539795283292","volume":"27","author":"R. Canetti","year":"1998","unstructured":"Canetti, R., Irani, S.: Bounding the power of preemption in randomized scheduling. SIAM Journal on Computing\u00a027(4), 993\u20131015 (1998)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"5_CR6","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. Journal of Discrete Algorithms\u00a04(2), 255\u2013276 (2006)","journal-title":"Journal of Discrete Algorithms"},{"issue":"3","key":"5_CR7","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":"5_CR8","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":"5_CR9","unstructured":"Englert, M., Westermann, M.: Considering suppressed packets improves buffer management in QoS switches. In: Proc. 18th ACM-SIAM Symposium on Discrete Algorithms, pp. 209\u2013218 (2007)"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Epstein, L., Levin, A.: Improved randomized results for that interval selection problem. In: Proc. 16th European Symposium of Algorithms (2008)","DOI":"10.1007\/978-3-540-87744-8_32"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/978-3-540-73545-8_19","volume-title":"Computing and Combinatorics","author":"S.P.Y. Fung","year":"2007","unstructured":"Fung, S.P.Y., Poon, C.K., Zheng, F.: Online interval scheduling: Randomized and multiprocessor cases. In: Lin, G. (ed.) COCOON 2007. LNCS, vol.\u00a04598, pp. 176\u2013186. Springer, Heidelberg (2007)"},{"issue":"3","key":"5_CR12","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"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1137\/S0097539792236882","volume":"24","author":"G. Koren","year":"1995","unstructured":"Koren, G., Shasha, D.: D over : An optimal on-line scheduling algorithm for overloaded uniprocessor real-time systems. SIAM Journal on Computing\u00a024, 318\u2013339 (1995)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"5_CR14","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1023\/B:JOSH.0000031423.39762.d3","volume":"7","author":"H. Miyazawa","year":"2004","unstructured":"Miyazawa, H., Erlebach, T.: An improved randomized on-line algorithm for a weighted interval selection problem. Journal of Scheduling\u00a07(4), 293\u2013311 (2004)","journal-title":"Journal of Scheduling"},{"issue":"4\u20135","key":"5_CR15","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/S0167-6377(98)00019-4","volume":"22","author":"S.S. Seiden","year":"1998","unstructured":"Seiden, S.S.: Randomized online interval scheduling. Operations Research Letters\u00a022(4\u20135), 171\u2013177 (1998)","journal-title":"Operations Research Letters"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/11758471_18","volume-title":"Algorithms and Complexity","author":"H.-F. Ting","year":"2006","unstructured":"Ting, H.-F.: A near optimal scheduler for on-demand data broadcasts. In: Calamoneri, T., Finocchi, I., Italiano, G.F. (eds.) CIAC 2006. LNCS, vol.\u00a03998, pp. 163\u2013174. Springer, Heidelberg (2006)"},{"issue":"1","key":"5_CR17","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0304-3975(94)90150-3","volume":"130","author":"G.J. Woeginger","year":"1994","unstructured":"Woeginger, G.J.: On-line scheduling of jobs with fixed start and end times. Theoretical Computer Science\u00a0130(1), 5\u201316 (1994)","journal-title":"Theoretical Computer Science"},{"key":"5_CR18","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","Approximation and Online Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-93980-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,6]],"date-time":"2025-02-06T22:31:05Z","timestamp":1738881065000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-93980-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783540939795","9783540939801"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-93980-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}