{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:16:36Z","timestamp":1759637796710},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,12,29]],"date-time":"2013-12-29T00:00:00Z","timestamp":1388275200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2014,7]]},"DOI":"10.1007\/s00224-013-9528-2","type":"journal-article","created":{"date-parts":[[2013,12,28]],"date-time":"2013-12-28T05:46:18Z","timestamp":1388209578000},"page":"202-228","source":"Crossref","is-referenced-by-count":12,"title":["Improved Randomized Online Scheduling of Intervals and Jobs"],"prefix":"10.1007","volume":"55","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","published-online":{"date-parts":[[2013,12,29]]},"reference":[{"key":"9528_CR1","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1145\/509907.509930","volume-title":"Proceedings of the Thirty Fourth Annual ACM Symposium on Theory of Computing","author":"S. Albers","year":"2002","unstructured":"Albers, S.: On randomized online scheduling. In: Proceedings of the Thirty Fourth Annual ACM Symposium on Theory of Computing, pp. 134\u2013143 (2002)"},{"key":"9528_CR2","first-page":"312","volume-title":"Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"B. Awerbuch","year":"1994","unstructured":"Awerbuch, B., Bartal, Y., Fiat, A., Rosen, A.: Competitive non-preemptive call control. In: Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 312\u2013320 (1994)"},{"issue":"2","key":"9528_CR3","doi-asserted-by":"crossref","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 Syst. 4(2), 125\u2013144 (1992)","journal-title":"Real-Time Syst."},{"key":"9528_CR4","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0012-365X(98)00310-0","volume":"201","author":"K.P. Bogart","year":"1999","unstructured":"Bogart, K.P., West, D.B.: A short proof that \u2018Proper = Unit\u2019. Discrete Math. 201, 21\u201323 (1999)","journal-title":"Discrete Math."},{"key":"9528_CR5","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, Cambridge (1998)"},{"issue":"4","key":"9528_CR6","doi-asserted-by":"crossref","first-page":"993","DOI":"10.1137\/S0097539795283292","volume":"27","author":"R. Canettie","year":"1998","unstructured":"Canettie, R., Irani, S.: Bounding the power of preemption in randomized scheduling. SIAM J. Comput. 27(4), 993\u20131015 (1998)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"9528_CR7","doi-asserted-by":"crossref","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., Tichy, T.: Online competitive algorithms for maximizing weighted throughput of unit jobs. J. Discrete Algorithms 4(2), 255\u2013276 (2006)","journal-title":"J. Discrete Algorithms"},{"issue":"3","key":"9528_CR8","doi-asserted-by":"crossref","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 time sharing or randomization help? Algorithmica 37(3), 149\u2013164 (2003)","journal-title":"Algorithmica"},{"issue":"6","key":"9528_CR9","doi-asserted-by":"crossref","first-page":"1709","DOI":"10.1137\/S0097539704446608","volume":"36","author":"M. Chrobak","year":"2007","unstructured":"Chrobak, M., Jawor, W., Sgall, J., Tichy, T.: Online scheduling of equal-length jobs: randomization and restarts help. SIAM J. Comput. 36(6), 1709\u20131728 (2007)","journal-title":"SIAM J. Comput."},{"key":"9528_CR10","first-page":"209","volume-title":"Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"M. Englert","year":"2007","unstructured":"Englert, M., Westermann, M.: Considering suppressed packets improves buffer management in QoS switches. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 209\u2013218 (2007)"},{"issue":"34\u201336","key":"9528_CR11","doi-asserted-by":"crossref","first-page":"3129","DOI":"10.1016\/j.tcs.2010.04.042","volume":"411","author":"L. Epstein","year":"2010","unstructured":"Epstein, L., Levin, A.: Improved randomized results for the interval selection problem. Theor. Comput. Sci. 411(34\u201336), 3129\u20133135 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"9528_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/978-3-540-85170-7","volume-title":"The 6th International Workshop on Approximation and Online Algorithms","author":"S.P.Y. Fung","year":"2008","unstructured":"Fung, S.P.Y., Poon, C.K., Zheng, F.: Improved randomized online scheduling of unit length intervals and jobs. In: The 6th International Workshop on Approximation and Online Algorithms. Lecture Notes in Computer Science, vol.\u00a05426, pp.\u00a053\u201366 (2008)"},{"issue":"3","key":"9528_CR13","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1007\/s10878-007-9131-z","volume":"16","author":"S.P.Y. Fung","year":"2008","unstructured":"Fung, S.P.Y., Poon, C.K., Zheng, F.: Online interval scheduling: randomized and multiprocessor cases. J. Comb. Optim. 16(3), 248\u2013262 (2008)","journal-title":"J. Comb. Optim."},{"issue":"4","key":"9528_CR14","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/s10951-007-0036-6","volume":"11","author":"S.P.Y. Fung","year":"2008","unstructured":"Fung, S.P.Y., Zheng, F.F., Chan, W.T., Chin, F.Y.L., Poon, C.K., Wong, P.W.H.: Improved on-line broadcast scheduling with deadlines. J. Sched. 11(4), 299\u2013308 (2008)","journal-title":"J. Sched."},{"issue":"3","key":"9528_CR15","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 325(3), 479\u2013488 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"9528_CR16","doi-asserted-by":"crossref","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 J. Comput. 24, 318\u2013339 (1995)","journal-title":"SIAM J. Comput."},{"key":"9528_CR17","first-page":"801","volume-title":"Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"F. Li","year":"2005","unstructured":"Li, F., Sethuraman, J., Stein, C.: An optimal online algorithm for packet scheduling with agreeable deadlines. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 801\u2013802 (2005)"},{"issue":"4","key":"9528_CR18","doi-asserted-by":"crossref","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. J. Sched. 7(4), 293\u2013311 (2004)","journal-title":"J. Sched."},{"issue":"4\u20135","key":"9528_CR19","doi-asserted-by":"crossref","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. Oper. Res. Lett. 22(4\u20135), 171\u2013177 (1998)","journal-title":"Oper. Res. Lett."},{"issue":"1\u20133","key":"9528_CR20","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.tcs.2008.03.031","volume":"410","author":"H.F. Ting","year":"2008","unstructured":"Ting, H.F.: A near optimal scheduler for on-demand data broadcasts. Theor. Comput. Sci. 410(1\u20133), 77\u201384 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"9528_CR21","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 130, 5\u201316 (1994)","journal-title":"Theor. Comput. Sci."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-013-9528-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-013-9528-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-013-9528-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,20]],"date-time":"2022-03-20T18:46:28Z","timestamp":1647801988000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-013-9528-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,29]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,7]]}},"alternative-id":["9528"],"URL":"https:\/\/doi.org\/10.1007\/s00224-013-9528-2","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12,29]]}}}