Abstract
In the extensible bin packing problem we are asked to pack a set of items into a given number of bins, each with an original size. However, the original bin sizes can be extended if necessary. The goal is to minimize the total size of the bins. We consider the problem with unequal (original) bin sizes and present the tight bound of a list scheduling algorithm for each collection of original bin sizes and each number of bins. We further give better on-line algorithms for the two-bin case and the three-bin case. Interestingly, it is shown that the on-line algorithms have better competitive ratios for unequal bins than for equal bins. Some variants of the problem are also discussed.
Supported by EU-Project CRESCCO (IST-2001-33135) and NSFC (10231060).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Alon, N., Azar, Y., Woeginger, G.J., Yadid, T.: Approximation schemes for scheduling on parallel machines. Journal of Scheduling 1, 55–66 (1998)
Azar, Y., Regev, O.: On-line bin-stretching. Theoretical Computer Science 268, 17–41 (2001)
Coffman, E.G., Lueker, G.S.: Approximation algorithms for extensible bin packing. In: Proceedings of the twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 586–588 (2001)
Dell’Olmo, P., Kellerer, H., Speranza, M.G., Tuza, Z.: A 13/12 approximation algorithm for bin packing with extendable bins. Information Processing Letters 65, 229–233 (1998)
Dell’Olmo, P., Speranza, M.G.: Approximation algorithms for partitioning small items in unequal bins to minimize the total size. Discrete Applied Mathematics 94, 181–191 (1999)
Epstein, L.: Bin stretching revisited. Acta Informatica 39, 97–117 (2003)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A guide to the Theory of NP-completeness. W.H.Freeman, San Francisco (1979)
Graham, R.: Bounds for certain multiprocessing anomalies. Bell System Technical Journal 45, 1563–1581 (1966)
Sgall, J.: On-line scheduling - A survey. In: Fiat, A., Woeginger, G.J. (eds.) Dagstuhl Seminar 1996. LNCS, vol. 1442, pp. 196–231. Springer, Heidelberg (1998)
Speranza, M.G., Tuza, Z.: On-line approximation algorithms for scheduling tasks on identical machines with extendable working time. Annals of Operations Research 86, 494–506 (1999)
Woeginger, G.J.: When does a dynamic programming formulation guarantee the existence of an FPTAS? In: Proceedings of the tenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 820–829 (1999)
Ye, D., Zhang, G.: On-line scheduling with extendable working time on a small number of machines. Information Processing Letters 85, 171–177 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ye, D., Zhang, G. (2004). On-Line Extensible Bin Packing with Unequal Bin Sizes. In: Solis-Oba, R., Jansen, K. (eds) Approximation and Online Algorithms. WAOA 2003. Lecture Notes in Computer Science, vol 2909. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24592-6_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-24592-6_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21079-5
Online ISBN: 978-3-540-24592-6
eBook Packages: Springer Book Archive