{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T21:28:34Z","timestamp":1765142914896},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212362"},{"type":"electronic","value":"9783540247494"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24749-4_17","type":"book-chapter","created":{"date-parts":[[2010,9,8]],"date-time":"2010-09-08T19:01:54Z","timestamp":1283972514000},"page":"187-198","source":"Crossref","is-referenced-by-count":22,"title":["Online Competitive Algorithms for Maximizing Weighted Throughput of Unit Jobs"],"prefix":"10.1007","author":[{"given":"Yair","family":"Bartal","sequence":"first","affiliation":[]},{"given":"Francis Y. L.","family":"Chin","sequence":"additional","affiliation":[]},{"given":"Marek","family":"Chrobak","sequence":"additional","affiliation":[]},{"given":"Stanley P. Y.","family":"Fung","sequence":"additional","affiliation":[]},{"given":"Wojciech","family":"Jawor","sequence":"additional","affiliation":[]},{"given":"Ron","family":"Lavi","sequence":"additional","affiliation":[]},{"given":"Ji\u0159\u00ed","family":"Sgall","sequence":"additional","affiliation":[]},{"given":"Tom\u00e1\u0161","family":"Tich\u00fd","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"Andelman, N., Mansour, Y., Zhu, A.: Competitive queueing policies for QoS switches. In: Proc. of the 14th ACM-SIAM SODA, pp. 761\u2013770 (2003)","key":"17_CR1"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/3-540-44679-6_51","volume-title":"Computing and Combinatorics","author":"E.-C. Chang","year":"2001","unstructured":"Chang, E.-C., Yap, C.: Competitive online scheduling with level of service. In: Wang, J. (ed.) COCOON 2001. LNCS, vol.\u00a02108, pp. 453\u2013462. Springer, Heidelberg (2001)"},{"unstructured":"Chin, F.Y.L., Fung, S.P.Y.: Online scheduling with partial job values and bounded importance ratio. In: Proc. of ICS, pp. 787\u2013794 (2002)","key":"17_CR3"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/3-540-45071-8_43","volume-title":"Computing and Combinatorics","author":"F.Y.L. Chin","year":"2003","unstructured":"Chin, F.Y.L., Fung, S.P.Y.: Improved competitive algorithms for online scheduling with partial job values. In: Warnow, T.J., Zhu, B. (eds.) COCOON 2003. LNCS, vol.\u00a02697, pp. 425\u2013434. Springer, Heidelberg (2003)"},{"issue":"3","key":"17_CR5","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s00453-003-1025-6","volume":"37","author":"F.Y.L. Chin","year":"2003","unstructured":"Chin, F.Y.L., Fung, S.P.Y.: Online scheduling for partial job values: does timesharing or randomization help? Algorithmica\u00a037(3), 149\u2013164 (2003)","journal-title":"Algorithmica"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1007\/3-540-45465-9_68","volume-title":"Automata, Languages and Programming","author":"M. Chrobak","year":"2002","unstructured":"Chrobak, M., Epstein, L., Noga, J., Sgall, J., van Stee, R., Tichy, T., Vakhania, N.: Preemptive scheduling in overloaded systems. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 800\u2013811. Springer, Heidelberg (2002)"},{"unstructured":"Hajek, B.: On the competitiveness of online scheduling of unit-length packets with hard deadlines in slotted time. In: CISS (2001)","key":"17_CR7"},{"doi-asserted-by":"crossref","unstructured":"Kesselman, A., Lotker, Z., Mansour, Y., Patt-Shamir, B., Schieber, B., Sviridenko, M.: Buffer overflow management in QoS switches. In: Proc. of the 33rd STOC, pp. 520\u2013529 (2001)","key":"17_CR8","DOI":"10.1145\/380752.380847"},{"doi-asserted-by":"crossref","unstructured":"Yao, A.: Probabilistic computations: Towards a unified measure of complexity. In: Proc. of the 18th FOCS, pp. 222\u2013227 (1977)","key":"17_CR9","DOI":"10.1109\/SFCS.1977.24"}],"container-title":["Lecture Notes in Computer Science","STACS 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24749-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T05:27:34Z","timestamp":1553059654000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24749-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212362","9783540247494"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24749-4_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}