On-line extensible bin packing with unequal bin sizes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2909, Issue , 2004, Pages 235-247

  Ye, Deshi ^a   Zhang, Guochuan ^a,b  

^a ZHEJIANG UNIVERSITY   (China)

^b UNIVERSITY OF KIEL   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; SCHEDULING ALGORITHMS;

BIN PACKING; BIN PACKING PROBLEM; BIN SIZE; COMPETITIVE RATIO; LIST SCHEDULING ALGORITHMS; ON-LINE ALGORITHMS; TIGHT BOUND;

BINS;

EID: 35048812980     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24592-6_19     Document Type: Article

References (12)

1. N. Alon, Y. Azar, G.J. Woeginger, and T. Yadid, Approximation schemes for scheduling on parallel machines, Journal of Scheduling 1 (1998), 55-66.
2. Y. Azar and O. Regev, On-line bin-stretching, Theoretical Computer Science 268 (2001), 17-41.
3. E.G. Coffman and G.S. Lueker, Approximation algorithms for extensible bin packing, Proceedings of the twelfth Annual ACM-SIAM Symposium on Discrete Algorithms (2001), 586-588.
4. P. Dell'Olmo, H. Kellerer, and M.G. Speranza, Z. Tuza, A 13/12 approximation algorithm for bin packing with extendable bins, Information Processing Letters 65 (1998), 229-233.
5. P. Dell'Olmo and M.G. Speranza, Approximation algorithms for partitioning small items in unequal bins to minimize the total size, Discrete Applied Mathematics 94 (1999), 181-191.
6. L. Epstein, Bin stretching revisited, Acta Informatica 39 (2003), 97-117.
7. M.R. Garey and D.S. Johnson, Computers and Intractability: A guide to the Theory of NP-completeness, W.H.Freeman, San Francisco, 1979.
8. R. Graham, Bounds for certain multiprocessing anomalies, Bell System Technical Journal 45 (1966), 1563-1581.
9. J. Sgall, On-line scheduling - A survey, Online Algorithms: The State of the Art, eds. A. Fiat and G. J. Woeginger, Lecture Notes in Comput. Sci. 1442, 196-231, Springer-Verlag, 1998.
10. M.G. Speranza and Z. Tuza, On-line approximation algorithms for scheduling tasks on identical machines with extendable working time, Annals of Operations Research 86 (1999), 494-506.
11. G.J. Woeginger, When does a dynamic programming formulation guarantee the existence of an FPTAS? In Proceedings of the tenth Annual ACM-SIAM Symposium on Discrete Algorithms (1999), 820-829.
12. D. Ye and G. Zhang, On-line scheduling with extendable working time on a small number of machines, Information Processing Letters 85 (2003), 171-177.