Abstract
The bin packing with rejection problem is the following: Given a list of items with associated sizes and rejection costs, find a packing into unit bins of a subset of the list, such that the number of bins used plus the sum of rejection costs of unpacked items is minimized. In this paper, we first show that bin packing with rejection can be reduced to n multiple knapsack problems. Then, based on techniques for the multiple knapsack problem we give a fast asymptotic polynomial time approximation scheme with time complexity \(O(n^{O(\epsilon^{-2})})\). This improves a recent approximation scheme given by Epstein, which has time complexity \(O(n^{O((\epsilon^{-4})^{\epsilon^{-1}})})\). Finally, we show that our algorithm can be extended to variable-sized bin packing with rejection and give an asymptotic polynomial time approximation scheme for it.
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
Bartal, W., Leonardi, S., Marchetti-Spaccamela, A., Sgall, J., Stougie, L.: Multiprocessor scheduling with rejection. SIAM Journal on Discrete Mathematics 13(1), 64–78 (2000)
Chekuri, C., Khanna, S.: A polynomial time approximation scheme for the multiple knapsack problem. SIAM J. Comput. 35(3), 713–728 (2005)
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, Boston (1996)
Dósa, G., He, Y.: Bin packing problems with rejection penalties and their dual problems. Information and Computation 204(5), 795–815 (2006)
Epstein, L.: Bin packing with rejection revisited. In: Erlebach, T., Kaklamanis, C. (eds.) WAOA 2006. LNCS, vol. 4368, pp. 146–159. Springer, Heidelberg (2007)
de la Vega, W.F., Lueker, G.: Bin packing can be solved within 1 + ε in linear time. Combinatorica 1, 349–355 (1981)
Friesen, D.K., Langston, M.A.: Variable sized bin packing. SIAM Journal on Computing 15(1), 222–230 (1986)
Hoogeveen, H., Skutella, M., Woeginger, G.: Preemptive scheduling with rejection. Mathematical Programming, Ser. B 94(2-3), 361–374 (2003)
Karmarkar, N., Karp, R.M.: An efficient approximation scheme for the one-dimensional bin-packing problem. In: Proc. 23rd Annual IEEE Symp. Found. Comput. Sci., pp. 312–320. IEEE Computer Society Press, Los Alamitos (1982)
Kellerer, H.: A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem. In: Hochbaum, D.S., Jansen, K., Rolim, J.D.P., Sinclair, A. (eds.) RANDOM 1999 and APPROX 1999. LNCS, vol. 1671, pp. 51–62. Springer, Heidelberg (1999)
Murgolo, F.D.: An efficient approximation scheme for variable-sized bin packing. SIAM Journal on Computing 16(1), 149–161 (1987)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bein, W., Correa, J.R., Han, X. (2007). A Fast Asymptotic Approximation Scheme for Bin Packing with Rejection. In: Chen, B., Paterson, M., Zhang, G. (eds) Combinatorics, Algorithms, Probabilistic and Experimental Methodologies. ESCAPE 2007. Lecture Notes in Computer Science, vol 4614. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74450-4_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-74450-4_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74449-8
Online ISBN: 978-3-540-74450-4
eBook Packages: Computer ScienceComputer Science (R0)