{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:59:13Z","timestamp":1725515953687},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540688655"},{"type":"electronic","value":"9783540688808"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68880-8_31","type":"book-chapter","created":{"date-parts":[[2008,7,31]],"date-time":"2008-07-31T02:37:59Z","timestamp":1217471879000},"page":"328-336","source":"Crossref","is-referenced-by-count":0,"title":["An Optimal Strategy for Online Non-uniform Length Order Scheduling"],"prefix":"10.1007","author":[{"given":"Feifeng","family":"Zheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinfeng","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoping","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"Fung, S.P.Y., Chin, F.Y.L., Poon, C.K.: Laxity helps in broadcast scheduling. In: Proceedings of 11th Italian Conference on Theoretical Computer Science, Siena, Italy, pp. 251\u2013264 (2005)","DOI":"10.1007\/11560586_21"},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"Zheng, F.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: Proceedings of the 12th Annual International Computing and Combinatorics Conference, Taipei, Taiwan, pp. 320\u2013329 (2006)","DOI":"10.1007\/11809678_34"},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"Ting, H.F.: A near optimal scheduler for on-demand data broadcasts. In: 6th Italian Conference on Algorithms and Complexity, Rome, Italy, pp. 163\u2013174 (2006)","DOI":"10.1007\/11758471_18"},{"key":"31_CR4","doi-asserted-by":"crossref","unstructured":"Kim, J.H., Chwa, K.Y.: Scheduling broadcasts with deadlines. In: Proceedings of 9th Italian Conference on Theoretical Computer Science, Big Sky, MT, USA, pp. 415\u2013424 (2003)","DOI":"10.1007\/3-540-45071-8_42"},{"key":"31_CR5","doi-asserted-by":"crossref","unstructured":"Zheng, F.F., Dai, W.Q., Xiao, P., Zhao, Y.: Competitive Strategies for On-line Production Order Disposal Problem. In: 1st International Conference on Algorithmic Applications In Management, Xi\u2019an, China, pp. 46\u201354 (2005)","DOI":"10.1007\/11496199_7"},{"key":"31_CR6","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, England (1998)"},{"issue":"1","key":"31_CR7","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0304-3975(94)90151-1","volume":"130","author":"R. Motwani","year":"1994","unstructured":"Motwani, R., Phillips, S., Torng, E.: Nonclairvoyant Scheduling. Theoretical Computer Science\u00a0130(1), 17\u201347 (1994)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"31_CR8","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1145\/792538.792545","volume":"50","author":"B. Kalyanasundaram","year":"2003","unstructured":"Kalyanasundaram, B., Pruhs, K.R.: Minimizing flow time nonclairvoyantly. Journal of the ACM\u00a050(4), 551\u2013567 (2003)","journal-title":"Journal of the ACM"},{"issue":"4","key":"31_CR9","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1145\/1008731.1008732","volume":"51","author":"L. Becchetti","year":"2004","unstructured":"Becchetti, L., Leonardi, S.: Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines. Journal of the ACM\u00a051(4), 517\u2013539 (2004)","journal-title":"Journal of the ACM"},{"key":"31_CR10","unstructured":"Lipton, R.J., Tomkins, A.: Online Interval Scheduling. In: Proc. Of the 5th Annual ACM-SIAM Symposium on Discrete Algorithm (SODA 1994), pp. 302\u2013311. New York (1994)"},{"issue":"2","key":"31_CR11","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(2), 183\u2013211 (2003)","journal-title":"Journal of Scheduling"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68880-8_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T00:17:08Z","timestamp":1620001028000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68880-8_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540688655","9783540688808"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68880-8_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}