Abstract
We introduce a new problem that was motivated by a (more complicated) problem arising in a robotized assembly environment. The bin coloring problem is to pack unit size colored items into bins, such that the maximum number of different colors per bin is minimized. Each bin has size B ∈ ℕ. The packing process is subject to the constraint that at any moment in time at most q ∈ ℕ bins are partially filled. Moreover, bins may only be closed if they are filled completely. An online algorithm must pack each item without knowledge of any future items.
We investigate the existence of competitive online algorithms for the bin coloring problem. We prove an upper bound of 3q ™ 1 and a lower bound of 2q for the competitive ratio of a natural greedy-type algorithm, and show that surprisingly a trivial algorithm which uses only one open bin has a strictly better competitive ratio of 2q ™ 1. Moreover, we show that any deterministic algorithm has a competitive ratio Ω(q) and that randomization does not improve this lower bound even when the adversary is oblivious.
Research supported by the German Science Foundation (DFG, grant GR 883/9-10)
Supported by the TMR Network DONET of the European Community ERB TMRX-CT98-0202
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
N. Ascheuer, M. Grötschel, S. O. Krumke, and J. Rambau, Combinatorial online optimization, Proceedings of the International Conference of Operations Research (OR’98), Springer, 1998, pp. 21–37.
A. Borodin and R. El-Yaniv, Online computation and competitive analysis, Cambridge University Press, 1998.
E. G. Coffman, M. R. Garey, and D. S. Johnson, Approximation algorithms for bin packing: a survey, In Hochbaum [6].
J. Csirik and G. J. Woeginger, On-line packing and covering problems, In G. J. Woeginger (eds.), Online algorithms: The state of the art, Lecture Notes in Computer Science, vol. 1442, Springer, 1998 Fiat and Woeginger [5].
A. Fiat and G. J. Woeginger (eds.), Online algorithms: The state of the art, Lecture Notes in Computer Science, vol. 1442, Springer, 1998.
D. S. Hochbaum (ed.), Approximation algorithms for NP-hard problems, PWS Publishing Company, 20 Park Plaza, Boston, MA 02116-4324, 1997.
R. Motwani and P. Raghavan, Randomized algorithms, Cambridge University Press, 1995.
C. Phillips, C. Stein, E. Torng, and J. Wein, Optimal time-critical scheduling via resource augmentation, Proceedings of the 29th Annual ACM Symposium on the Theory of Computing, 1997, pp. 140–149.
K. Pruhs and B. Kalyanasundaram, Speed is as powerful as clairvoyance, Proceedings of the 36th Annual IEEE Symposium on the Foundations of Computer Science, 1995, pp. 214–221.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Krumke, S.O., de Paepe, W.E., Rambau, J., Stougie, L. (2001). Online Bin Coloring. In: auf der Heide, F.M. (eds) Algorithms — ESA 2001. ESA 2001. Lecture Notes in Computer Science, vol 2161. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44676-1_6
Download citation
DOI: https://doi.org/10.1007/3-540-44676-1_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42493-2
Online ISBN: 978-3-540-44676-7
eBook Packages: Springer Book Archive