{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T09:34:05Z","timestamp":1725701645104},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642330896"},{"type":"electronic","value":"9783642330902"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33090-2_2","type":"book-chapter","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T11:29:11Z","timestamp":1346153351000},"page":"2-11","source":"Crossref","is-referenced-by-count":8,"title":["Open Problems in Throughput Scheduling"],"prefix":"10.1007","author":[{"given":"Ji\u0159\u00ed","family":"Sgall","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s10288-003-0024-4","volume":"2","author":"P. Baptiste","year":"2004","unstructured":"Baptiste, P., Brucker, P., Knust, S., Timkovsky, V.: Ten notes on equal-execution-time scheduling. 4OR\u00a02, 111\u2013127 (2004)","journal-title":"4OR"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1023\/A:1024012811536","volume":"6","author":"P. Baptiste","year":"2003","unstructured":"Baptiste, P., Schieber, B.: A note on scheduling tall\/small multiprocessor tasks with unit processing time to minimize maximum tardiness. J. Sched.\u00a06, 395\u2013404 (2003)","journal-title":"J. Sched."},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1002\/(SICI)1099-1425(199911\/12)2:6<245::AID-JOS28>3.0.CO;2-5","volume":"2","author":"P. Baptiste","year":"1999","unstructured":"Baptiste, P.: Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times. J. Sched.\u00a02, 245\u2013252 (1999)","journal-title":"J. Sched."},{"key":"2_CR4","first-page":"65","volume":"39","author":"S.K. Baruah","year":"2001","unstructured":"Baruah, S.K., Haritsa, J., Sharma, N.: On-line scheduling to maximize task completions. J. Comb. Math. Comb. Comput.\u00a039, 65\u201378 (2001)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"2_CR5","unstructured":"Bie\u0144kowski, M., Chrobak, M., D\u00fcrr, C., Hurand, M., Je\u017c, A., Je\u017c, \u0141., Stachowiak, G.: Collecting weighted items from a dynamic queue. To appear in ACM Trans. Algorithms"},{"key":"2_CR6","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, 255\u2013276 (2006)","journal-title":"Journal of Discrete Algorithms"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10951-006-5595-4","volume":"9","author":"M. Chrobak","year":"2006","unstructured":"Chrobak, M., D\u00fcrr, C., Jawor, W., Kowalik, \u0141., Kurowski, M.: A note on scheduling equal-length jobs to maximize throughput. J. Sched.\u00a09, 71\u201373 (2006)","journal-title":"J. Sched."},{"issue":"4","key":"2_CR8","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/1290672.1290687","volume":"3","author":"M. Chrobak","year":"2007","unstructured":"Chrobak, M., Jawor, W., Sgall, J., Tich\u00fd, T.: Improved online algorithms for buffer management in QoS switches. ACM Trans. Algorithms\u00a03(4), 19 (2007)","journal-title":"ACM Trans. Algorithms"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"1709","DOI":"10.1137\/S0097539704446608","volume":"36","author":"M. Chrobak","year":"2007","unstructured":"Chrobak, M., Jawor, W., Sgall, J., Tich\u00fd, T.: Online scheduling of equal-length jobs: Randomization and restarts help. SIAM J. Comput.\u00a036, 1709\u20131728 (2007)","journal-title":"SIAM J. Comput."},{"key":"2_CR10","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":"2_CR11","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":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/11841036_30","volume-title":"Algorithms \u2013 ESA 2006","author":"C. D\u00fcrr","year":"2006","unstructured":"D\u00fcrr, C., Hurand, M.: Finding Total Unimodularity in Optimization Problems Solved by Linear Programs. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol.\u00a04168, pp. 315\u2013326. Springer, Heidelberg (2006)"},{"key":"2_CR13","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":"2_CR14","unstructured":"Englert, M., Westerman, M.: Considering suppressed packets improves buffer management in QoS switches. In: Proc. 18th Symp. on Discrete Algorithms (SODA), pp. 209\u2013218. ACM\/SIAM (2007)"},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-642-32512-0_12","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"L. Epstein","year":"2012","unstructured":"Epstein, L., Je\u017c, \u0141., Sgall, J., van Stee, R.: Online Scheduling of Jobs with Fixed Start Times on Related Machines. In: Gupta, A., Jansen, K., Rolim, J., Servedio, R. (eds.) APPROX 2012 and RANDOM 2012. LNCS, vol.\u00a07408, pp. 134\u2013145. Springer, Heidelberg (2012)"},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1006\/jagm.1999.1060","volume":"34","author":"S.A. Goldman","year":"2000","unstructured":"Goldman, S.A., Parwatikar, J., Suri, S.: Online scheduling with hard deadlines. J. Algorithms\u00a034, 370\u2013389 (2000)","journal-title":"J. Algorithms"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/11785293_13","volume-title":"Algorithm Theory \u2013 SWAT 2006","author":"M.H. Goldwasser","year":"2006","unstructured":"Goldwasser, M.H., Pedigo, M.: Online, Non-preemptive Scheduling of Equal-Length Jobs on Two Identical Machines. In: Arge, L., Freivalds, R. (eds.) SWAT 2006. LNCS, vol.\u00a04059, pp. 113\u2013123. Springer, Heidelberg (2006)"},{"key":"2_CR18","unstructured":"Je\u017c, \u0141.: Randomized algorithm for agreeable deadlines packet scheduling. In: Proc. 27th Symp. on Theoretical Aspects of Computer Science (STACS), pp. 489\u2013500 (2010)"},{"key":"2_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-642-23719-5_21","volume-title":"Algorithms \u2013 ESA 2011","author":"\u0141. Je\u017c","year":"2011","unstructured":"Je\u017c, \u0141.: One to Rule Them All: A\u00a0General Randomized Algorithm for Buffer Management with Bounded Delay. In: Demetrescu, C., Halld\u00f3rsson, M.M. (eds.) ESA 2011. LNCS, vol.\u00a06942, pp. 239\u2013250. Springer, Heidelberg (2011)"},{"key":"2_CR20","unstructured":"Je\u017c, \u0141., Li, F., Sethuraman, J., Stein, C.: Online scheduling of packets with agreeable deadlines. To appear in ACM Trans. Algorithms"},{"key":"2_CR21","unstructured":"Li, F., Sethuraman, J., Stein, C.: An optimal online algorithm for packet scheduling with agreeable deadlines. In: Proc. 16th Symp. on Discrete Algorithms (SODA), pp. 801\u2013802. ACM\/SIAM (2005)"},{"key":"2_CR22","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0304-3975(94)90150-3","volume":"130","author":"G.J. Woeginger","year":"1994","unstructured":"Woeginger, G.J.: On-line scheduling of jobs with fixed start and end times. Theoret. Comput. Sci.\u00a0130, 5\u201316 (1994)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR23","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/j.ipl.2007.01.005","volume":"102","author":"D. Ye","year":"2007","unstructured":"Ye, D., Zhang, G.: Maximizing the throughput of parallel jobs on hypercubes. Inform. Process. Lett.\u00a0102, 259\u2013263 (2007)","journal-title":"Inform. Process. Lett."},{"key":"2_CR24","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1142\/S0129054109006590","volume":"20","author":"O. Zaj\u00ed\u010dek","year":"2009","unstructured":"Zaj\u00ed\u010dek, O.: A note on scheduling parallel unit jobs on hypercubes. Int. J. on Found. Comput. Sci.\u00a020, 341\u2013349 (2009)","journal-title":"Int. J. on Found. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33090-2_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:54:47Z","timestamp":1620114887000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33090-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642330896","9783642330902"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33090-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}