{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:57:19Z","timestamp":1725555439393},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642124495"},{"type":"electronic","value":"9783642124501"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12450-1_11","type":"book-chapter","created":{"date-parts":[[2010,5,5]],"date-time":"2010-05-05T15:01:49Z","timestamp":1273071709000},"page":"116-127","source":"Crossref","is-referenced-by-count":4,"title":["Online Scheduling of Bounded Length Jobs to Maximize Throughput"],"prefix":"10.1007","author":[{"given":"Christoph","family":"D\u00fcrr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u0141ukasz","family":"Je\u017c","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kim Thang","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"11_CR1","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/S0167-6377(98)00045-5","volume":"24","author":"P. Baptiste","year":"1999","unstructured":"Baptiste, P.: An O(n\n                  4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Oper. Res. Lett.\u00a024(4), 175\u2013180 (1999)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"11_CR2","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1016\/j.orl.2003.09.004","volume":"32","author":"P. Baptiste","year":"2004","unstructured":"Baptiste, P., Chrobak, M., D\u00fcrr, C., Jawor, W., Vakhania, N.: Preemptive scheduling of equal-length jobs to maximize weighted throughput. Operations Research Letters\u00a032(3), 258\u2013264 (2004)","journal-title":"Operations Research Letters"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Baruah, S.K., Haritsa, J., Sharma, N.: On-line scheduling to maximize task completions. In: Real-Time Systems Symposium, December 1994, pp. 228\u2013236 (1994)","DOI":"10.1109\/REAL.1994.342713"},{"issue":"4","key":"11_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 J. Comput.\u00a027(4), 993\u20131015 (1998)","journal-title":"SIAM J. Comput."},{"key":"11_CR5","doi-asserted-by":"crossref","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: Proc. 10th International on Computing and Combinatorics Conference, pp. 210\u2013218 (2004)","DOI":"10.1007\/978-3-540-27798-9_24"},{"key":"11_CR6","first-page":"21","volume-title":"Handbook of Combinatorial Optimization","author":"B. Chen","year":"1998","unstructured":"Chen, B., Potts, C.N., Woeginger, G.J.: A review of machine scheduling: Complexity, algorithms and approximability. In: Handbook of Combinatorial Optimization, vol.\u00a03, pp. 21\u2013169. Kluwer Academic Publishers, Dordrecht (1998)"},{"issue":"6","key":"11_CR7","doi-asserted-by":"publisher","first-page":"1709","DOI":"10.1137\/S0097539704446608","volume":"36","author":"M. Chrobak","year":"2007","unstructured":"Chrobak, M., Jawor, W., Sgall, J., Tich\u00fd, T.: Online scheduling of equal-length jobs: Randomization and restarts help. SIAM J. Comput.\u00a036(6), 1709\u20131728 (2007)","journal-title":"SIAM J. Comput."},{"key":"11_CR8","unstructured":"Englert, M., Westermann, M.: Considering suppressed packets improves buer management in QoS switches. In: Proc. 18th Symp. on Discrete Algorithms (SODA), pp. 209\u2013218. ACM\/SIAM (2007)"},{"key":"11_CR9","unstructured":"Hajek, B.: On the competitiveness of online scheduling of unit-length packets with hard deadlines in slotted time. In: Proceedings of Conference on Information Sciences and Systems (CISS), pp. 434\u2013438 (2001)"},{"issue":"4","key":"11_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"},{"issue":"1","key":"11_CR11","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0196-6774(03)00074-9","volume":"49","author":"B. Kalyanasundaram","year":"2003","unstructured":"Kalyanasundaram, B., Pruhs, K.: Maximizing job completions online. Journal of Algorithms\u00a049(1), 63\u201385 (2003)","journal-title":"Journal of Algorithms"},{"issue":"2","key":"11_CR12","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0895-7177(94)90209-7","volume":"20","author":"E.L. Lawler","year":"1994","unstructured":"Lawler, E.L.: Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the \u201ctower of sets\u201d property. Mathl. Comput. Modelling\u00a020(2), 91\u2013106 (1994)","journal-title":"Mathl. Comput. Modelling"},{"issue":"1-3","key":"11_CR13","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.tcs.2008.03.031","volume":"401","author":"H.-F. Ting","year":"2008","unstructured":"Ting, H.-F.: A near optimal scheduler for on-demand data broadcasts. Theoretical Computer Science\u00a0401(1-3), 77\u201384 (2008)","journal-title":"Theoretical Computer Science"},{"key":"11_CR14","unstructured":"Vakhania, N.: A fast on-line algorithm for the preemptive scheduling of equal-length jobs on a single processor. In: Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications, pp. 158\u2013161 (2008)"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12450-1_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T07:41:43Z","timestamp":1619768503000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12450-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642124495","9783642124501"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12450-1_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}