{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:28:31Z","timestamp":1759638511755,"version":"3.37.3"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2017,4,27]],"date-time":"2017-04-27T00:00:00Z","timestamp":1493251200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004281","name":"Narodowe Centrum Nauki","doi-asserted-by":"publisher","award":["2016\/21\/D\/ST6\/02402"],"award-info":[{"award-number":["2016\/21\/D\/ST6\/02402"]}],"id":[{"id":"10.13039\/501100004281","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005386","name":"Israeli Centers for Research Excellence","doi-asserted-by":"publisher","award":["Center No. 4\/11"],"award-info":[{"award-number":["Center No. 4\/11"]}],"id":[{"id":"10.13039\/501100005386","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1444\/14"],"award-info":[{"award-number":["1444\/14"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006245","name":"Ministry of Science and Technology, Israel","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100006245","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s10951-017-0522-4","type":"journal-article","created":{"date-parts":[[2017,4,27]],"date-time":"2017-04-27T07:16:58Z","timestamp":1493277418000},"page":"623-634","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Scheduling multipacket frames with frame deadlines"],"prefix":"10.1007","volume":"20","author":[{"given":"\u0141ukasz","family":"Je\u017c","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yishay","family":"Mansour","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Boaz","family":"Patt-Shamir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,4,27]]},"reference":[{"key":"522_CR1","unstructured":"Awerbuch, B., Bartal, Y., Fiat, A., & Ros\u00e9n, A. (1994). Competitive non-preemptive call control. In Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), (pp. 312\u2013320). \n                        http:\/\/dl.acm.org\/citation.cfm?id=314464.314510\n                        \n                    ."},{"key":"522_CR2","doi-asserted-by":"publisher","unstructured":"Azar, Y., & Gilon, O. (2015). Buffer management for packets with processing times. In Proceedings of the 23rd Annual European Symposium on Algorithms (ESA), (pp. 47\u201358). doi:\n                        10.1007\/978-3-662-48350-3_5\n                        \n                    .","DOI":"10.1007\/978-3-662-48350-3_5"},{"issue":"2","key":"522_CR3","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/BF00365406","volume":"4","author":"SK Baruah","year":"1992","unstructured":"Baruah, S. K., Koren, G., Mao, D., Mishra, B., Raghunathan, A., Rosier, L. E., et al. (1992). On the competitiveness of on-line real-time task scheduling. Real-Time Systems, 4(2), 125\u2013144. doi:\n                        10.1007\/BF00365406\n                        \n                    .","journal-title":"Real-Time Systems"},{"key":"522_CR4","doi-asserted-by":"publisher","unstructured":"D\u00fcrr, C., Je\u017c, \u0141., & Nguyen, K. T. (2012). Online scheduling of bounded length jobs to maximize throughput. Journal of Scheduling, 15(5), 653\u2013664. doi:\n                        10.1007\/s10951-011-0233-1\n                        \n                    . Also appeared in Proceedings of the 7th Workshop on Approximation and Online Algorithms (WAOA), (pp. 116\u2013127). (2009).","DOI":"10.1007\/s10951-011-0233-1"},{"key":"522_CR5","doi-asserted-by":"publisher","unstructured":"Emek, Y., Halld\u00f3rsson, M. M., Mansour, Y., Patt-Shamir, B., Radhakrishnan, J., & Rawitz, D. (2012). Online set packing. SIAM Journal on Computing, 41(4), 728\u2013746. doi:\n                        10.1137\/110820774\n                        \n                    . Also appeared in Proceedings of the 29th ACM Symposium on Principles of Distributed Computing (PODC), (pp. 440\u2013449). (2010).","DOI":"10.1137\/110820774"},{"key":"522_CR6","doi-asserted-by":"publisher","unstructured":"Epstein, L., Je\u017c, \u0141., Sgall, J., & van Stee, R. (2016). Online scheduling of jobs with fixed start times on related machines. Algorithmica, 74(1), 156\u2013176. doi:\n                        10.1007\/s00453-014-9940-2\n                        \n                    . Also appeared in Proceedings of the 15th International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX), (pp. 134\u2013145). (2012).","DOI":"10.1007\/s00453-014-9940-2"},{"key":"522_CR7","doi-asserted-by":"publisher","unstructured":"Kalyanasundaram, B., & Pruhs, K. (2000). Speed is as powerful as clairvoyance. J. ACM, 47(4), 617\u2013643. doi:\n                        10.1145\/347476.347479\n                        \n                    . Also appeared in Proc. of the 36th Symp. on Foundations of Comp. Sci. (FOCS), (pp. 214\u2013221). (1995).","DOI":"10.1145\/347476.347479"},{"key":"522_CR8","doi-asserted-by":"publisher","unstructured":"Kalyanasundaram, B., & Pruhs, K. (2003). Maximizing job completions online. Journal of Algorithms, 49(1), 63\u201385. doi:\n                        10.1016\/S0196-6774(03)00074-9\n                        \n                    . Also appeared in Proceedings of the 6th European Symposium on Algorithms (ESA), (pp. 235\u2013246). (1998).","DOI":"10.1016\/S0196-6774(03)00074-9"},{"key":"522_CR9","doi-asserted-by":"publisher","unstructured":"Kesselman, A., Patt-Shamir, B., & Scalosub, G. (2013). Competitive buffer management with packet dependencies. Theoretical Computer Science, 489\u2013490, 75\u201387. doi:\n                        10.1016\/j.tcs.2013.04.007\n                        \n                    . Also appeared in 23rd IEEE International Parallel and Distributed Processing Symposium (IPDPS), (pp. 1\u201312). (2009).","DOI":"10.1016\/j.tcs.2013.04.007"},{"issue":"1","key":"522_CR10","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1145\/321738.321743","volume":"20","author":"CL Liu","year":"1973","unstructured":"Liu, C. L., & Layland, J. W. (1973). Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the ACM, 20(1), 46\u201361. doi:\n                        10.1145\/321738.321743\n                        \n                    .","journal-title":"Journal of the ACM"},{"key":"522_CR11","doi-asserted-by":"publisher","unstructured":"Lucier, B., Menache, I., Naor, J., & Yaniv, J. (2013). Efficient online scheduling for deadline-sensitive jobs: Extended abstract. In 25th ACM Symposium on Parallelism in Algorithms and Architectures, (SPAA\u201913), (pp. 305\u2013314). doi:\n                        10.1145\/2486159.2486187\n                        \n                    .","DOI":"10.1145\/2486159.2486187"},{"key":"522_CR12","doi-asserted-by":"publisher","unstructured":"Mansour, Y., Patt-Shamir, B., & Rawitz, D. (2012). Overflow management with multipart packets. Computer Networks, 56(15), 3456\u20133467. doi:\n                        10.1016\/j.comnet.2012.07.001\n                        \n                    . Also appeared in Proceedings of the 30th IEEE International Conference on Computer Communications (INFOCOM), (pp. 2606\u20132614). (2011).","DOI":"10.1016\/j.comnet.2012.07.001"},{"key":"522_CR13","doi-asserted-by":"publisher","unstructured":"Markovitch, M., & Scalosub, G. (2014). Bounded delay scheduling with packet dependencies. In Proceedings of the IEEE INFOCOM Workshops, (pp. 257\u2013262). doi:\n                        10.1109\/INFCOMW.2014.6849241\n                        \n                    .","DOI":"10.1109\/INFCOMW.2014.6849241"},{"key":"522_CR14","doi-asserted-by":"publisher","unstructured":"Scalosub, G., Marbach, P., & Liebeherr, J. (2013). Buffer management for aggregated streaming data with packet dependencies. IEEE Transactions on Parallel Distributed Systems, 24(3), 439\u2013449. doi:\n                        10.1109\/TPDS.2012.65\n                        \n                    . Also appeared in Proceedings of the 29th IEEE International Conference on Computer Communications (INFOCOM), (pp. 241\u2013245). (2010).","DOI":"10.1109\/TPDS.2012.65"},{"issue":"1","key":"522_CR15","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0304-3975(94)90150-3","volume":"130","author":"GJ Woeginger","year":"1994","unstructured":"Woeginger, G. J. (1994). On-line scheduling of jobs with fixed start and end times. Theoretical Computer Science, 130(1), 5\u201316. doi:\n                        10.1016\/0304-3975(94)90150-3\n                        \n                    .","journal-title":"Theoretical Computer Science"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-017-0522-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-017-0522-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-017-0522-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,11,21]],"date-time":"2017-11-21T09:30:44Z","timestamp":1511256644000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-017-0522-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,27]]},"references-count":15,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["522"],"URL":"https:\/\/doi.org\/10.1007\/s10951-017-0522-4","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"type":"print","value":"1094-6136"},{"type":"electronic","value":"1099-1425"}],"subject":[],"published":{"date-parts":[[2017,4,27]]}}}