{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T11:18:24Z","timestamp":1742383104647},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291060"},{"type":"electronic","value":"9783540320241"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11560586_21","type":"book-chapter","created":{"date-parts":[[2005,10,20]],"date-time":"2005-10-20T10:08:27Z","timestamp":1129802907000},"page":"251-264","source":"Crossref","is-referenced-by-count":13,"title":["Laxity Helps in Broadcast Scheduling"],"prefix":"10.1007","author":[{"given":"Stanley P. Y.","family":"Fung","sequence":"first","affiliation":[]},{"given":"Francis Y. L.","family":"Chin","sequence":"additional","affiliation":[]},{"given":"Chung Keung","family":"Poon","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","unstructured":"DirecPC Homepage, \n                    \n                      http:\/\/www.direcpc.com"},{"key":"21_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"21_CR3","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. To appear in Journal of Discrete Algorithms, a preliminary version appeared in Proc. 21st STACS (2004)"},{"key":"21_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/978-3-540-27836-8_32","volume-title":"Automata, Languages and Programming","author":"M. Chrobak","year":"2004","unstructured":"Chrobak, M., Jawor, W., Sgall, J., Tich\u00fd, T.: Online scheduling of equal-length jobs: randomization and restarts help. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 358\u2013370. Springer, Heidelberg (2004)"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1002\/jos.85","volume":"4","author":"B. DasGupta","year":"2001","unstructured":"DasGupta, B., Palis, M.A.: On-line real-time preemptive scheduling of jobs with deadlines on multiple machines. Journal of Scheduling\u00a04, 297\u2013312 (2001)","journal-title":"Journal of Scheduling"},{"issue":"2","key":"21_CR6","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1006\/jagm.1999.1060","volume":"34","author":"S.A. Goldman","year":"2000","unstructured":"Goldman, S.A., Parwatikar, J., Suri, S.: Online scheduling with hard deadlines. Journal of Algorithms\u00a034(2), 370\u2013389 (2000)","journal-title":"Journal of Algorithms"},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1023\/A:1022994010777","volume":"6","author":"M.H. Goldwasser","year":"2003","unstructured":"Goldwasser, M.H.: Patience is a virtue: the effect of slack on competitiveness for admission control. Journal of Scheduling\u00a06, 183\u2013211 (2003)","journal-title":"Journal of Scheduling"},{"issue":"5","key":"21_CR8","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/S0167-6377(00)00061-4","volume":"27","author":"H. Hoogeveen","year":"2000","unstructured":"Hoogeveen, H., Potts, C.N., Woeginger, G.J.: On-line scheduling on a single machine: maximizing the number of early jobs. Operations Research Letters\u00a027(5), 193\u2013197 (2000)","journal-title":"Operations Research Letters"},{"key":"21_CR9","unstructured":"Hung, R.Y.S., Ting, H.F.: Online scheduling a batch processing system with incompatible job families, manuscript (2005)"},{"issue":"4","key":"21_CR10","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1145\/347476.347479","volume":"47","author":"B. Kalyanasundaram","year":"2000","unstructured":"Kalyanasundaram, B., Pruhs, K.: Speed is as powerful as clairvoyance. Journal of the ACM\u00a047(4), 617\u2013643 (2000)","journal-title":"Journal of the ACM"},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-540-39658-1_30","volume-title":"Algorithms - ESA 2003","author":"B. Kalyanasundaram","year":"2003","unstructured":"Kalyanasundaram, B., Velauthapillai, M.: On-demand broadcasting under deadline. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 313\u2013324. Springer, Heidelberg (2003)"},{"issue":"3","key":"21_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"},{"issue":"1","key":"21_CR13","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":"21_CR14","unstructured":"Zheng, F., Fung, S.P.Y., Chin, F.Y.L., Poon, C.K., Xu, Y.: Improved on-line broadcast scheduling with deadlines (Submitted for publication)"}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11560586_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:13:17Z","timestamp":1619493197000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11560586_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291060","9783540320241"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11560586_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}