{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:32:39Z","timestamp":1725489159371},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540735441"},{"type":"electronic","value":"9783540735458"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-73545-8_19","type":"book-chapter","created":{"date-parts":[[2007,8,17]],"date-time":"2007-08-17T09:44:11Z","timestamp":1187343851000},"page":"176-186","source":"Crossref","is-referenced-by-count":3,"title":["Online Interval Scheduling: Randomized and Multiprocessor Cases"],"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":"19_CR1","unstructured":"Awerbuch, B., Bartal, Y., Fiat, A., Rosen, A.: Competitive non-preemptive call control. In: Proc. 5th SODA, pp. 312\u2013320 (1994)"},{"key":"19_CR2","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":"19_CR3","doi-asserted-by":"publisher","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 proper = unit. Discrete Mathematics\u00a0201, 21\u201323 (1999)","journal-title":"Discrete Mathematics"},{"issue":"4","key":"19_CR4","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"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1007\/978-3-540-27798-9_24","volume-title":"Computing and Combinatorics","author":"W.-T. Chan","year":"2004","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: Chwa, K.-Y., Munro, J.I.J. (eds.) COCOON 2004. LNCS, vol.\u00a03106, pp. 210\u2013218. Springer, Heidelberg (2004)"},{"key":"19_CR6","unstructured":"Faigle, U., Nawijn, W.M.: Greedy k-coverings of interval orders. Technical Report 979, University of Twente (1991)"},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/11560586_21","volume-title":"Theoretical Computer Science","author":"S.P.Y. Fung","year":"2005","unstructured":"Fung, S.P.Y., Chin, F.Y.L., Poon, C.K.: Laxity helps in broadcast scheduling. In: Coppo, M., Lodi, E., Pinna, G.M. (eds.) ICTCS 2005. LNCS, vol.\u00a03701, pp. 251\u2013264. Springer, Heidelberg (2005)"},{"issue":"3","key":"19_CR8","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":"19_CR9","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1137\/S0097539792236882","volume":"24","author":"G. Koren","year":"1995","unstructured":"Koren, G., Shasha, D.: D\n                \n                  over\n                : 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":"1-2","key":"19_CR10","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0304-3975(94)90165-1","volume":"128","author":"G. Koren","year":"1994","unstructured":"Koren, G., Shasha, D.: MOCA: A multiprocessor on-line competitive algorithm for real-time system scheduling. Theoretical Computer Science\u00a0128(1-2), 75\u201397 (1994)","journal-title":"Theoretical Computer Science"},{"key":"19_CR11","unstructured":"Lipton, R.J., Tomkins, A.: Online interval scheduling. In: Proc. 5th SODA, pp. 302\u2013311 (1994)"},{"issue":"4","key":"19_CR12","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":"19_CR13","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":"19_CR14","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":"19_CR15","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":"19_CR16","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","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73545-8_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T21:02:14Z","timestamp":1558472534000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73545-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540735441","9783540735458"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73545-8_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}