{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,30]],"date-time":"2022-12-30T22:26:36Z","timestamp":1672439196358},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2008,8,1]],"date-time":"2008-08-01T00:00:00Z","timestamp":1217548800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2008,8]]},"DOI":"10.1007\/s10951-007-0036-6","type":"journal-article","created":{"date-parts":[[2007,9,27]],"date-time":"2007-09-27T15:49:26Z","timestamp":1190908166000},"page":"299-308","source":"Crossref","is-referenced-by-count":9,"title":["Improved on-line broadcast scheduling with deadlines"],"prefix":"10.1007","volume":"11","author":[{"given":"Stanley P. Y.","family":"Fung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feifeng","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wun-Tat","family":"Chan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francis Y. L.","family":"Chin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chung Keung","family":"Poon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prudence W. H.","family":"Wong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,8,1]]},"reference":[{"key":"36_CR1","unstructured":"Aksoy, D., & Franklin, M. (1998). Scheduling for large scale on-demand data broadcast. In Proceedings of IEEE INFOCOM (pp.\u00a0651\u2013659)."},{"key":"36_CR2","unstructured":"Bartal, Y., & Muthukrishnan, S. (2000). Minimizing maximum response time in scheduling broadcasts. In Proceedings 11th ACM\u2013SIAM symposium on discrete algorithms (pp.\u00a0558\u2013559)."},{"key":"36_CR3","volume-title":"Online computation and competitive analysis","author":"A. Borodin","year":"1998","unstructured":"Borodin, A., & El-yaniv, R. (1998). Online computation and competitive analysis. Cambridge: Cambridge University Press."},{"key":"36_CR4","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":"10th international computing and combinatorics conference","author":"W.-T. Chan","year":"2004","unstructured":"Chan, W.-T., Lam, T.-W., Ting, H.-F., & Wong, P. W. H. (2004). New results on on-demand broadcasting with deadline via job scheduling with cancellation. In Lecture notes in computer science\n: Vol.\u00a03106. 10th international computing and combinatorics conference (pp. 210\u2013218). Berlin: Springer."},{"key":"36_CR5","unstructured":"DirecPC Home Page. \n                    http:\/\/www.direcpc.com\/"},{"key":"36_CR6","unstructured":"Edmonds, J., & Pruhs, K. (2002). Broadcast scheduling: when fairness is fine. In Proceedings 13th ACM\u2013SIAM symposium on discrete algorithms (pp.\u00a0421\u2013430)."},{"key":"36_CR7","unstructured":"Erlebach, T., & Hall, A. (2002). NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow. In Proceedings 13th ACM\u2013SIAM symposium on discrete algorithms (pp.\u00a0194\u2013202)."},{"issue":"4","key":"36_CR8","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/s00453-003-1058-x","volume":"38","author":"R. Gandhi","year":"2004","unstructured":"Gandhi, R., Khuller, S., Kim, Y. A., & Wan, Y. C. (2004). Algorithms for minimizing response time in broadcast scheduling. Algorithmica, 38(4), 597\u2013608.","journal-title":"Algorithmica"},{"key":"36_CR9","doi-asserted-by":"crossref","unstructured":"Jiang, S., & Vaidya, N. (1999). Scheduling data broadcasts to \u201cimpatient\u201d users. In Proceedings ACM international workshop on data engineering for wireless and mobile access (pp.\u00a052\u201359).","DOI":"10.1145\/313300.313385"},{"key":"36_CR10","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1007\/3-540-45253-2_27","volume-title":"Proceedings 8th European symposium on algorithms","author":"B. Kalyanasundaram","year":"2000","unstructured":"Kalyanasundaram, B., Pruhs, K., & Velauthapillai, M. (2000). Scheduling broadcasts in wireless networks. In Lecture notes in computer science\n: Vol.\u00a01879. Proceedings 8th European symposium on algorithms (pp.\u00a0290\u2013301). Berlin: Springer."},{"key":"36_CR11","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/978-3-540-39658-1_30","volume-title":"Proc. 11th European symposium on algorithms","author":"B. Kalyanasundaram","year":"2003","unstructured":"Kalyanasundaram, B., & Velauthapillai, M. (2003). On-demand broadcasting under deadline. In Lecture notes in computer science\n: Vol.\u00a02832. Proc. 11th European symposium on algorithms (pp.\u00a0313\u2013324). Berlin: Springer."},{"issue":"3","key":"36_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. (2004). Scheduling broadcasts with deadlines. Theoretical Computer Science, 325(3), 479\u2013488.","journal-title":"Theoretical Computer Science"},{"key":"36_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. (1994). On-line scheduling of jobs with fixed start and end times. Theoretical Computer Science, 130, 5\u201316.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"36_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ipl.2005.09.001","volume":"97","author":"F. Zheng","year":"2006","unstructured":"Zheng, F., Chin, F. Y. L., Fung, S. P. Y., Poon, Ch. K., & Xu, Y. (2006). A tight lower bound for job scheduling with cancellation. Information Processing Letters, 97(1), 1\u20133.","journal-title":"Information Processing Letters"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-007-0036-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-007-0036-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-007-0036-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-007-0036-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:40Z","timestamp":1559468380000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-007-0036-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,8]]}},"alternative-id":["36"],"URL":"https:\/\/doi.org\/10.1007\/s10951-007-0036-6","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,8]]}}}