Max-min online allocations with a reordering buffer

SIAM Journal on Discrete Mathematics

Volumn 25, Issue 3, 2011, Pages 1230-1250

  Epstein, Leah ^a   Levin, Asaf ^b   Van Stee, Rob ^c  

^a UNIVERSITY OF HAIFA   (Israel)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Analysis; Competitive; Max min allocations; Scheduling; Semionline algorithms

Indexed keywords

ANALYSIS; BUFFER SIZES; COMPETITIVE; COMPETITIVE RATIO; GREEDY ALGORITHMS; IDENTICAL MACHINES; MAX-MIN; MINIMUM LOAD; ON-LINE ALGORITHMS; ONLINE SCHEDULING; RELATED MACHINES; RELATIVE ORDER; SCHEDULING PROBLEM; SEMIONLINE ALGORITHMS; THREE MODELS; TIGHT BOUND; TWO MACHINES; UPPER BOUND;

MATHEMATICAL TECHNIQUES; SCHEDULING;

SCHEDULING ALGORITHMS;

EID: 82955186933     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/100794006     Document Type: Article

References (28)

1. S. ALBERS, Better bounds for online scheduling, SIAM J. Comput., 29 (1999), pp. 459-473.
2. A. ASADPOUR, U. FEIGE, AND A. SABERI, Santa Claus meets hypergraph matchings, in Proceedings of the 11th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2008, pp. 10-20.
3. A. ASADPOUR AND A. SABERI, An approximation algorithm for max-min fair allocation of indivisible goods, SIAM J. Comput., 39 (2010), pp. 2970-2989.
4. J. ASPNES, Y. AZAR, A. FIAT, S. PLOTKIN, AND O. WAARTS, On-line load balancing with applications to machine scheduling and virtual circuit routing, J. ACM, 44 (1997), pp. 486-504. (Pubitemid 127634587)
5. Y. AZAR AND L. EPSTEIN, On-line machine covering, in Proceedings of the 5th European Symposium on Algorithms (ESA), Lecture Notes in Comput. Sci. 1284, Springer, New York, 1997, pp. 23-36. (Pubitemid 127119217)
6. Y. AZAR, J. NAOR, AND R. ROM, The competitiveness of on-line assignments, J. Algorithms, 18 (1995), pp. 221-237.
7. N. BANSAL AND M. SVIRIDENKO, The Santa Claus problem, in Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006, pp. 31-40. (Pubitemid 44306535)
8. P. BERMAN, M. CHARIKAR, AND M. KARPINSKI, On-line load balancing for related machines, J. Algorithms, 35 (2000), pp. 108-121.
9. S.-Y. CAI, Semi-online machine covering, Asia-Pac. J. Oper. Res., 24 (2007), pp. 373-382. (Pubitemid 47116911)
10. O. CHASSID AND L. EPSTEIN, The hierarchical model for load balancing on two machines, J. Comb. Optim., 15 (2008), pp. 305-314. (Pubitemid 351399916)
11. B. CHEN, A. VAN VLIET, AND G. J. WOEGINGER, An optimal algorithm for preemptive on-line scheduling, Oper. Res. Lett., 18 (1995), pp. 127-131.
12. J. CSIRIK, H. KELLERER, AND G. WOEGINGER, The exact LPT-bound for maximizing the minimum completion time, Oper. Res. Lett., 11 (1992), pp. 281-287. (Pubitemid 23581851)
13. B. L. DEUERMEYER, D. K. FRIESEN, AND M. A. LANGSTON, Scheduling to maximize the minimum processor finish time in a multiprocessor system, SIAM J. Algebraic Discrete Methods, 3 (1982), pp. 190-196.
14. GY. DÓSA AND L. EPSTEIN, Online scheduling with a buffer on related machines, J. Comb. Optim., 20 (2010), pp. 161-179.
15. GY. DÓSA AND L. EPSTEIN, Preemptive online scheduling with reordering, SIAM J. Discrete Math., 25 (2011), pp. 21-49.
16. T. EBENLENDR, J. NOGA, J. SGALL, AND G. J. WOEGINGER, A note on semi-online machine covering, in Proceedings of the 3rd International Workshop on Approximation and Online Algorithms (WAOA), 2005, pp. 110-118. (Pubitemid 43987050)
17. M. ENGLERT, D. ÖZMEN, AND M. WESTERMANN, The power of reordering for online minimum makespan scheduling, in Proceedings of the 48th IEEE Symposium on Foundations of Computer Science, 2008, pp. 603-612.
18. L. EPSTEIN AND J. SGALL, Approximation schemes for scheduling on uniformly related and identical parallel machines, Algorithmica, 39 (2004), pp. 43-57. (Pubitemid 40871672)
19. U. FEIGE, On allocations that maximize fairness, in Proceedings of the 19th ACM Symposium on Discrete Algorithms, 2008, pp. 287-293.
20. D. K. FRIESEN AND B. L. DEUERMEYER, Analysis of greedy solutions for a replacement part sequencing problem, Math. Oper. Res., 6 (1981), pp. 74-87. (Pubitemid 12437571)
21. T. GORMLEY, N. REINGOLD, E. TORNG, AND J. WESTBROOK, Generating adversaries for request-answer games, in Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, 2000, pp. 564-565. (Pubitemid 30549305)
22. R. L. GRAHAM, Bounds for certain multiprocessing anomalies, Bell Syst. Tech. J., 45 (1966), pp. 1563-1581.
23. B. HAEUPLER, B. SAHA, AND A. SRINIVASAN, New constructive aspects of the Lovasz local lemma, in Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science, 2010, pp. 397-406.
24. Y. JIANG, Z. TAN, AND Y. HE, Preemptive machine covering on parallel machines, J. Comb. Optim., 10 (2005), pp. 345-363. (Pubitemid 41660715)
25. H. KELLERER, V.KOTOV, M. G. SPERANZA, AND ZS. TUZA, Semi online algorithms for the partition problem, Oper. Res. Lett., 21 (1997), pp. 235-242. (Pubitemid 127437875)
26. Z. TAN AND Y. WU, Optimal semi-online algorithms for machine covering, Theoret. Comput. Sci., 372 (2007), pp. 69-80. (Pubitemid 46241654)
27. G. J. WOEGINGER, A polynomial time approximation scheme for maximizing the minimum machine completion time, Oper. Res. Lett., 20 (1997), pp. 149-154. (Pubitemid 127427672)
28. max with a buffer, Inform. Process. Lett., 61 (1997), pp. 145-148. (Pubitemid 127412259)