{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T18:13:35Z","timestamp":1725732815754},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387081"},{"type":"electronic","value":"9783642387098"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44602-7_5","type":"book-chapter","created":{"date-parts":[[2014,8,23]],"date-time":"2014-08-23T01:18:40Z","timestamp":1408756720000},"page":"54-65","source":"Crossref","is-referenced-by-count":1,"title":["Online Scheduling of Unit Length Jobs with Commitment and Penalties"],"prefix":"10.1007","author":[{"given":"Stanley P. Y.","family":"Fung","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Hartline, J.D., Kleinberg, R.D.: Selling ad campaigns: online algorithms with cancellations. In: Proc. 10th ACM Conference on Electronic Commerce, pp. 61\u201370 (2009)","DOI":"10.1145\/1566374.1566383"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/978-3-642-13731-0_33","volume-title":"Algorithm Theory - SWAT 2010","author":"D.P. Bunde","year":"2010","unstructured":"Bunde, D.P., Goldwasser, M.H.: Dispatching equal-length jobs to parallel machines to maximize throughput. In: Kaplan, H. (ed.) SWAT 2010. LNCS, vol.\u00a06139, pp. 346\u2013358. Springer, Heidelberg (2010)"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Chen, S., Tong, L., He, T.: Optimal deadline scheduling with commitment. In: 49th Annual Allerton Conference on Communication, Control and Computing, pp. 111\u2013118 (2011)","DOI":"10.1109\/Allerton.2011.6120157"},{"issue":"2","key":"5_CR4","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.jda.2005.03.005","volume":"4","author":"F.Y.L. Chin","year":"2006","unstructured":"Chin, F.Y.L., Chrobak, M., Fung, S.P.Y., Jawor, W., Sgall, J., Tich\u00fd, T.: Online competitive algorithms for maximizing weighted throughput of unit jobs. Journal of Discrete Algorithms\u00a04(2), 255\u2013276 (2006)","journal-title":"Journal of Discrete Algorithms"},{"issue":"3","key":"5_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 with partial job values: Does timesharing or randomization help? Algorithmica\u00a037(3), 149\u2013164 (2003)","journal-title":"Algorithmica"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-540-79309-0_16","volume-title":"Algorithmic Game Theory","author":"R. Cole","year":"2008","unstructured":"Cole, R., Dobzinski, S., Fleischer, L.K.: Prompt mechanisms for online auctions. In: Monien, B., Schroeder, U.-P. (eds.) SAGT 2008. LNCS, vol.\u00a04997, pp. 170\u2013181. Springer, Heidelberg (2008)"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Constantin, F., Feldman, J., Muthukrishnan, S., Pal, M.: An online mechanism for ad slot reservations with cancellations. In: Proc. 20th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1265\u20131274 (2009)","DOI":"10.1137\/1.9781611973068.137"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/978-3-540-75520-3_39","volume-title":"Algorithms \u2013 ESA 2007","author":"J. Ding","year":"2007","unstructured":"Ding, J., Ebenlendr, T., Sgall, J., Zhang, G.: Online scheduling of equal-length jobs on parallel machines. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol.\u00a04698, pp. 427\u2013438. Springer, Heidelberg (2007)"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/11775096_5","volume-title":"Algorithmic Aspects in Information and Management","author":"J. Ding","year":"2006","unstructured":"Ding, J., Zhang, G.: Online scheduling with hard deadlines on parallel machines. In: Cheng, S.-W., Poon, C.K. (eds.) AAIM 2006. LNCS, vol.\u00a04041, pp. 32\u201342. Springer, Heidelberg (2006)"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-540-93980-1_4","volume-title":"Approximation and Online Algorithms","author":"T. Ebenlendr","year":"2009","unstructured":"Ebenlendr, T., Sgall, J.: A lower bound for scheduling of unit jobs with immediate decision on parallel machines. In: Bampis, E., Skutella, M. (eds.) WAOA 2008. LNCS, vol.\u00a05426, pp. 43\u201352. Springer, Heidelberg (2009)"},{"key":"5_CR11","unstructured":"Englert, M., Westermann, M.: Considering suppressed packets improves buffer management in QoS switches. In: Proc. 18th ACM-SIAM Symposium on Discrete Algorithms, pp. 209\u2013218 (2007)"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-642-14031-0_42","volume-title":"Computing and Combinatorics","author":"S.P.Y. Fung","year":"2010","unstructured":"Fung, S.P.Y.: Online preemptive scheduling with immediate decision or notification and penalties. In: Thai, M.T., Sahni, S. (eds.) COCOON 2010. LNCS, vol.\u00a06196, pp. 389\u2013398. Springer, Heidelberg (2010)"},{"issue":"1","key":"5_CR13","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1145\/1753171.1753195","volume":"45","author":"M.H. Goldwasser","year":"2010","unstructured":"Goldwasser, M.H.: A survey of buffer management policies for packet switches. SIGACT News\u00a045(1), 100\u2013128 (2010)","journal-title":"SIGACT News"},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1023\/A:1022956425198","volume":"6","author":"M.H. Goldwasser","year":"2003","unstructured":"Goldwasser, M.H., Kerbikov, B.: Admission control with immediate notification. Journal of Scheduling\u00a06, 269\u2013285 (2003)","journal-title":"Journal of Scheduling"},{"key":"5_CR15","unstructured":"Hajek, B.: On the competitiveness of on-line scheduling of unit-length packets with hard deadlines in slotted time. In: Proc. Conference on Information Sciences and Systems, pp. 434\u2013438 (2001)"},{"key":"5_CR16","unstructured":"Kaminsky, P., Hochbaum, D.: Due date quotation models and algorithms. In: Leung, J.Y.-T., Henderson, J.H. (eds.) Handbook of Scheduling: Algorithms, Models, and Performance Analysis, ch.\u00a020. Chapman and Hall\/CRC (2004)"},{"issue":"2","key":"5_CR17","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1287\/mnsc.47.2.264.9836","volume":"47","author":"P. Keskinocak","year":"2001","unstructured":"Keskinocak, P., Ravi, R., Tayur, S.: Scheduling and reliable lead-time quotation for orders with availability intervals and lead-time sensitive revenues. Management Science\u00a047(2), 264\u2013279 (2001)","journal-title":"Management Science"},{"key":"5_CR18","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. 33th ACM Symposium on Theory of Computing, pp. 520\u2013529 (2001)","DOI":"10.1145\/380752.380847"},{"key":"5_CR19","unstructured":"Pruhs, K., Sgall, J., Torng, E.: Online Scheduling. In: Leung, J.Y.-T., Henderson, J.H. (eds.) Handbook of Scheduling: Algorithms, Models, and Performance Analysis, ch.\u00a015. Chapman and Hall\/CRC (2004)"},{"key":"5_CR20","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.jalgor.2004.04.007","volume":"53","author":"A. Zhu","year":"2004","unstructured":"Zhu, A.: Analysis of queueing policies in QoS switches. Journal of Algorithms\u00a053, 137\u2013168 (2004)","journal-title":"Journal of Algorithms"}],"container-title":["Lecture Notes in Computer Science","Advanced Information Systems Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44602-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T17:08:03Z","timestamp":1558976883000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44602-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642387081","9783642387098"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44602-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}