{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:45:53Z","timestamp":1743021953405,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319894409"},{"type":"electronic","value":"9783319894416"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-89441-6_15","type":"book-chapter","created":{"date-parts":[[2018,3,30]],"date-time":"2018-03-30T09:43:23Z","timestamp":1522403003000},"page":"190-206","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Packet Scheduling with Adversarial Jamming and Speedup"],"prefix":"10.1007","author":[{"given":"Martin","family":"B\u00f6hm","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u0141ukasz","family":"Je\u017c","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ji\u0159\u00ed","family":"Sgall","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pavel","family":"Vesel\u00fd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,31]]},"reference":[{"issue":"2","key":"15_CR1","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s10951-015-0451-z","volume":"19","author":"A Fern\u00e1ndez Anta","year":"2016","unstructured":"Fern\u00e1ndez Anta, A., Georgiou, C., Kowalski, D.R., Widmer, J., Zavou, E.: Measuring the impact of adversarial errors on packet scheduling strategies. J. Sched. 19(2), 135\u2013152 (2016)","journal-title":"J. Sched."},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-28448-4_1","volume-title":"Adaptive Resource Management and Scheduling for Cloud Computing","author":"A Fern\u00e1ndez Anta","year":"2015","unstructured":"Fern\u00e1ndez Anta, A., Georgiou, C., Kowalski, D.R., Zavou, E.: Competitive analysis of task scheduling algorithms on a fault-prone machine and the impact of resource augmentation. In: Pop, F., Potop-Butucaru, M. (eds.) ARMS-CC 2015. LNCS, vol. 9438, pp. 1\u201316. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-28448-4_1"},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.tcs.2015.01.027","volume":"590","author":"A Fern\u00e1ndez Anta","year":"2015","unstructured":"Fern\u00e1ndez Anta, A., Georgiou, C., Kowalski, D.R., Zavou, E.: Online parallel scheduling of non-uniform tasks. Theor. Comput. Sci. 590, 129\u2013146 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/S0022-0000(03)00070-9","volume":"67","author":"M Chrobak","year":"2003","unstructured":"Chrobak, M., Epstein, L., Noga, J., Sgall, J., van Stee, R., Tich\u00fd, T., Vakhania, N.: Preemptive scheduling in overloaded systems. J. Comput. Syst. Sci. 67, 183\u2013197 (2003)","journal-title":"J. Comput. Syst. Sci."},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Garncarek, P., Jurdzi\u0144ski, T., Lory\u015b, K.: Fault-tolerant online packet scheduling on parallel channels. In: 2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp. 347\u2013356, May 2017","DOI":"10.1109\/IPDPS.2017.105"},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.jpdc.2015.07.007","volume":"84","author":"C Georgiou","year":"2015","unstructured":"Georgiou, C., Kowalski, D.R.: On the competitiveness of scheduling dynamically injected tasks on processes prone to crashes and restarts. J. Parallel Distrib. Comput. 84, 94\u2013107 (2015)","journal-title":"J. Parallel Distrib. Comput."},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-319-18263-6_17","volume-title":"Approximation and Online Algorithms","author":"T Jurdzinski","year":"2015","unstructured":"Jurdzinski, T., Kowalski, D.R., Lorys, K.: Online packet scheduling under adversarial jamming. In: Bampis, E., Svensson, O. (eds.) WAOA 2014. LNCS, vol. 8952, pp. 193\u2013206. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18263-6_17"},{"issue":"4","key":"15_CR8","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. J. ACM 47(4), 617\u2013643 (2000)","journal-title":"J. ACM"},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0304-3975(02)00407-3","volume":"295","author":"C-Y Koo","year":"2003","unstructured":"Koo, C.-Y., Lam, T.W., Ngan, T.-W., Sadakane, K., To, K.-K.: On-line scheduling with tight deadlines. Theor. Comput. Sci. 295, 251\u2013261 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/j.jalgor.2003.10.004","volume":"52","author":"TW Lam","year":"2004","unstructured":"Lam, T.W., Ngan, T.-W., To, T.-T.: Performance guarantee for EDF under overload. J. Algorithms 52, 193\u2013206 (2004)","journal-title":"J. Algorithms"},{"key":"15_CR11","unstructured":"Lam, T.W., To, K.-K.: Trade-offs between speed and processor in hard-deadline scheduling. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 623\u2013632. ACM\/SIAM (1999)"},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s00453-001-0068-9","volume":"32","author":"CA Phillips","year":"2002","unstructured":"Phillips, C.A., Stein, C., Torng, E., Wein, J.: Optimal time-critical scheduling via resource augmentation. Algorithmica 32, 163\u2013200 (2002)","journal-title":"Algorithmica"},{"key":"15_CR13","unstructured":"Schewior, K.: Deadline scheduling and convex-body chasing. Ph.D dissertation, TU Berlin (2016)"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-89441-6_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T12:20:44Z","timestamp":1710246044000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-89441-6_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319894409","9783319894416"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-89441-6_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"31 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Approximation and Online Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vienna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 September 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waoa2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo2017.ac.tuwien.ac.at\/waoa","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}