Abstract
In this paper we consider the following problems: We are given a set of n items {u 1, ⋯, u n }, each item u i is characterized by its size w i ∈ (0,1] and its penalty/profit p i ≥ 0, and a number of unit-capacity bins. An item can be either rejected, in which case we pay/get its penalty/profit, or put into one bin under the constraint that the total size of the items in the bin is not greater/smaller than 1. No item can be spread into more than one bin. The objective is to minimize/maximize the sum of the number of used/covered bins and the penalties/profits of all rejected items. We call the problems bin packing/covering with rejection penalties/profits, and denoted by BPR and BCR respectively. For the online BPR problem, we present an algorithm with an absolute competitive ratio of 2.618 while the lower bound is 2.343, and an algorithm with an asymptotic competitive ratio of arbitrarily close to 7/4 while the lower bound is 1.540. For the offline BPR problem, we present an algorithm with an absolute worst-case ratio of 2 while the lower bound is 3/2, and an algorithm with an asymptotic worst-case ratio of 3/2. For the online BCR problem, we show that no algorithm can have an absolute competitive ratio of greater than 0, and present an algorithm with an asymptotic competitive ratio of 1/2, which is the best possible. For the offline BCR problem, we also present an algorithm with an absolute worst-case ratio of 1/2 which matches the lower bound.
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
Assman, S.B., Johnson, D.S., Kleitman, D.J., Leung, J.Y.T.: On the dual of one-dimensional bin-packing problem. J. of Algorithms 5, 502–525 (1984)
Coffman, E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing: A survey. In: Hochbaum, D. (ed.) Approximation algorithms for NP-hard problems, pp. 46–93. PWS Publishing (1997)
Csirik, J., Johnson, D.S., Kenyon, C.: Better approximation algorithms for bin covering. In: Proc. of SIAM Conference on Discrete Algorithms, Washington, DC, pp. 557–566 (2001)
Csirik, J., Totik, V.: On-line algorithms for a dual version of bin packing. Discrete Applied Mathematics 21, 163–167 (1988)
Csirik, J., Woeginger, G.: On-line packing and covering problems. In: Fiat, A. (ed.) Dagstuhl Seminar 1996. LNCS, vol. 1442, pp. 147–177. Springer, Heidelberg (1998)
Chen, W., Yang, J., Lu, D., Pan, Y.: Two mathematical models and algorithms of internet communications. Chinese J. Computers 21, 51–55 (1999) (in Chinese)
Garey, M.R., Johnson, D.S.: Computer and Intractability: A Guide to the theory of NP-Completeness. Freeman, New York (1979)
Jansen, K., Solis-Oba, R.: An asymptotic fully polynomial time approximation scheme for bin covering. Theoretical Computer Science 306, 543–551 (2003)
Johnson, D.S., Demers, A., Ullman, J.D., Garey, M.R., Graham, R.L.: Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J. on Computing 3, 299–325 (1974)
Karmarkar, N., Karp, R.M.: An efficient approximation scheme for the onedimensional bin packing problem. In: Proc. 23rd Annual Symposium on Foundations of Computer Science, Chicago, pp. 312–320 (1982)
Seiden, S.S.: On the online bin packing problem. J. of the ACM 49, 640–671 (2002)
Simchi-Levi, D.: New worst-case results for the bin-packing problemma. Naval Research Logistics 41, 579–585 (1994)
Van Vliet, A.: An improved lower bound for on-line bin packing algorithms, Information. Processing Letters 43, 277–284 (1992)
Ye, D., Zhang, G.: On-line scheduling of parallel jobs. In: Kralovic, R., Sýkora, O. (eds.) SIROCCO 2004. LNCS, vol. 3104, pp. 279–290. Springer, Heidelberg (2004)
Zhang, G.C., Cai, X.Q., Wong, C.K.: Linear-time approximation algorithms for bin packing problem. Operations Research Letters 26, 217–222 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
He, Y., Dósa, G. (2005). Bin Packing and Covering Problems with Rejection. In: Wang, L. (eds) Computing and Combinatorics. COCOON 2005. Lecture Notes in Computer Science, vol 3595. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11533719_89
Download citation
DOI: https://doi.org/10.1007/11533719_89
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28061-3
Online ISBN: 978-3-540-31806-4
eBook Packages: Computer ScienceComputer Science (R0)