{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T06:55:32Z","timestamp":1649141732072},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2012,10]]},"DOI":"10.1007\/s10951-011-0233-1","type":"journal-article","created":{"date-parts":[[2011,4,8]],"date-time":"2011-04-08T20:09:27Z","timestamp":1302293367000},"page":"653-664","source":"Crossref","is-referenced-by-count":4,"title":["Online scheduling of bounded length jobs to maximize throughput"],"prefix":"10.1007","volume":"15","author":[{"given":"Christoph","family":"D\u00fcrr","sequence":"first","affiliation":[]},{"given":"\u0141ukasz","family":"Je\u017c","sequence":"additional","affiliation":[]},{"given":"Nguyen Kim","family":"Thang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,4,9]]},"reference":[{"key":"233_CR1","first-page":"312","volume-title":"Proc. 5th symp. on discrete algorithms","author":"B. Awerbuch","year":"1994","unstructured":"Awerbuch, B., Bartal, Y., Fiat, A., & Ros\u00e9n, A. (1994). Competitive non-preemptive call control. In Proc. 5th symp. on discrete algorithms (pp. 312\u2013320)."},{"issue":"4","key":"233_CR2","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/S0167-6377(98)00045-5","volume":"24","author":"P. Baptiste","year":"1999","unstructured":"Baptiste, P. (1999). An O(n 4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Operations Research Letters, 24(4), 175\u2013180.","journal-title":"Operations Research Letters"},{"issue":"3","key":"233_CR3","doi-asserted-by":"crossref","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. (2004). Preemptive scheduling of equal-length jobs to maximize weighted throughput. Operations Research Letters, 32(3), 258\u2013264.","journal-title":"Operations Research Letters"},{"key":"233_CR4","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1109\/REAL.1994.342713","volume-title":"Real-time systems symposium","author":"S. Baruah","year":"1994","unstructured":"Baruah, S., Haritsa, J., & Sharma, N. (1994). On-line scheduling to maximize task completions. In Real-time systems symposium (pp. 228\u2013236)."},{"issue":"4","key":"233_CR5","doi-asserted-by":"crossref","first-page":"993","DOI":"10.1137\/S0097539795283292","volume":"27","author":"R. Canetti","year":"1998","unstructured":"Canetti, R., & Irani, S. (1998). Bounding the power of preemption in randomized scheduling. SIAM Journal on Computing, 27(4), 993\u20131015.","journal-title":"SIAM Journal on Computing"},{"key":"233_CR6","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1007\/978-3-540-27798-9_24","volume-title":"Proc. 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 Proc. 10th international computing and combinatorics conference (pp.\u00a0210\u2013218)."},{"key":"233_CR7","first-page":"21","volume-title":"Handbook of combinatorial optimization","author":"B. Chen","year":"1998","unstructured":"Chen, B., Potts, C. N., & Woeginger, G. J. (1998). A\u00a0review of machine scheduling: complexity, algorithms and approximability. In Handbook of combinatorial optimization (Vol.\u00a03, pp.\u00a021\u2013169). Dordrecht: Kluwer Academic."},{"issue":"6","key":"233_CR8","doi-asserted-by":"crossref","first-page":"1709","DOI":"10.1137\/S0097539704446608","volume":"36","author":"M. Chrobak","year":"2007","unstructured":"Chrobak, M., Jawor, W., Sgall, J., & Tich\u00fd, T. (2007). Online scheduling of equal-length jobs: randomization and restarts help. SIAM Journal on Computing, 36(6), 1709\u20131728.","journal-title":"SIAM Journal on Computing"},{"key":"233_CR9","first-page":"209","volume-title":"Proc. 18th symp. on discrete algorithms (SODA)","author":"M. Englert","year":"2007","unstructured":"Englert, M., & Westermann, M. (2007). Considering suppressed packets improves buffer management in QoS switches. In Proc. 18th symp. on discrete algorithms (SODA) (pp. 209\u2013218)."},{"key":"233_CR10","first-page":"434","volume-title":"Proceedings of conference on information sciences and systems (CISS)","author":"B. Hajek","year":"2001","unstructured":"Hajek, B. (2001). 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)."},{"issue":"4","key":"233_CR11","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1145\/347476.347479","volume":"47","author":"B. Kalyanasundaram","year":"2000","unstructured":"Kalyanasundaram, B., & Pruhs, K. (2000). Speed is as powerful as clairvoyance. Journal of the ACM, 47(4), 617\u2013643.","journal-title":"Journal of the ACM"},{"issue":"1","key":"233_CR12","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0196-6774(03)00074-9","volume":"49","author":"B. Kalyanasundaram","year":"2003","unstructured":"Kalyanasundaram, B., & Pruhs, K. (2003). Maximizing job completions online. Journal of Algorithms, 49(1), 63\u201385.","journal-title":"Journal of Algorithms"},{"issue":"2","key":"233_CR13","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0895-7177(94)90209-7","volume":"20","author":"E.L. Lawler","year":"1994","unstructured":"Lawler, E.L. (1994). Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the \u201ctower of sets\u201d property. Mathematical and Computer Modelling, 20(2), 91\u2013106.","journal-title":"Mathematical and Computer Modelling"},{"issue":"1\u20133","key":"233_CR14","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.tcs.2008.03.031","volume":"401","author":"H. F. Ting","year":"2008","unstructured":"Ting, H. F. (2008). A\u00a0near optimal scheduler for on-demand data broadcasts. Theoretical Computer Science, 401(1\u20133), 77\u201384.","journal-title":"Theoretical Computer Science"},{"key":"233_CR15","first-page":"158","volume-title":"Proceedings of the 2nd WSEAS international conference on computer engineering and applications","author":"N. Vakhania","year":"2008","unstructured":"Vakhania, N. (2008). A\u00a0fast 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)."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/s10951-011-0233-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T22:17:24Z","timestamp":1497910644000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-011-0233-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4,9]]},"references-count":15,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2012,10]]}},"alternative-id":["233"],"URL":"https:\/\/doi.org\/10.1007\/s10951-011-0233-1","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,4,9]]}}}