Bin packing with rejection revisited

Algorithmica (New York)

Volumn 56, Issue 4, 2010, Pages 505-528

  Epstein, Leah ^a  

^a UNIVERSITY OF HAIFA   (Israel)

Author keywords

Approximation schemes; Bin packing; Online algorithms

Indexed keywords

APPROXIMATION RATIOS; APPROXIMATION SCHEME; ASYMPTOTIC COMPETITIVE RATIO; BIN PACKING; BIN PACKING PROBLEM; BOUNDED SPACE ALGORITHMS; COMPETITIVE RATIO; NON-TRIVIAL; OFFLINE; ON-LINE ALGORITHMS; ONLINE VERSIONS; STANDARD PROBLEMS; UNBOUNDED SPACE;

ASYMPTOTIC ANALYSIS; BINS; STANDARDS;

APPROXIMATION ALGORITHMS;

EID: 74849130190     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-008-9188-9     Document Type: Conference Paper

References (28)

1. Bansal, N., Blum, A., Chawla, S., Dhamdhere, K.: Scheduling for flow-time with admission control. In: Proc. of the 11th Annual European Symposium on Algorithms (ESA2003), pp. 43-54 (2003)
2. Y. Bartal S. Leonardi A. Marchetti-Spaccamela J. Sgall L. Stougie 2000 Multiprocessor scheduling with rejection SIAM J. Discrete Math. 13 1 64 78 0936.68012 10.1137/S0895480196300522 1737935
3. Bein, W.W., Correa, J.R., Han, X.: A fast asymptotic approximation scheme for bin packing with rejection. In: Proc. of the 1st International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (ESCAPE2007), pp. 209-218 (2007)
4. A. Caprara H. Kellerer U. Pferschy 2003 Approximation schemes for ordered vector packing problems Naval Res. Logist. 92 58 69 10.1002/nav.10058 1950281
5. Coffman, E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing: a survey. In: Hochbaum, D. (ed.) Approximation Algorithms. PWS Publishing Company, Boston (1997)
6. Csirik, J., Woeginger, G.J.: On-line packing and covering problems. In: Fiat, A., Woeginger, G.J. (eds.) Online Algorithms: The State of the Art, pp. 147-177 (1998)
7. J. Csirik G.J. Woeginger 2002 Resource augmentation for online bounded space bin packing J. Algorithms 44 2 308 320 1026.68154 10.1016/S0196-6774(02) 00202-X 1932053 (Pubitemid 35312134)
8. W. Fernandez de la Vega G.S. Lueker 1981 Bin packing can be solved within 1+ε in linear time Combinatorica 1 349 355 0485.68057 10.1007/BF02579456 647985
9. Dósa, G.: The tight bound of first fit decreasing bin-packing algorithm is FFD(I)≤11/9OPT(I)+6/9
10. G. Dósa Y. He 2006 Bin packing problems with rejection penalties and their dual problems Inf. Comput. 204 5 795 815 1110.68172 10.1016/j.ic.2006.02.003
11. D.W. Engels D.R. Karger S.G. Kolliopoulos S. Sengupta R.N. Uma J. Wein 2003 Techniques for scheduling with rejection J. Algorithms 49 1 175 191 1067.68024 10.1016/S0196-6774(03)00078-6 2027063
12. Epstein, L., Levin, A.: AFPTAS results for common variants of bin packing: a new method to handle the small items. Manuscript (2007)
13. Garey, M.R., Johnson, D.S.: Computers and Intractability. Freeman, New York (1979)
14. D.S. Hochbaum D.B. Shmoys 1987 Using dual approximation algorithms for scheduling problems: theoretical and practical results J. ACM 34 1 144 162 882666
15. Hoogeveen, H., Skutella, M., Woeginger, G.J.: Preemptive scheduling with rejection. In: Proc. of the 8th Annual European Symposium on Algorithms (ESA2000), pp. 268-277 (2000)
16. D.S. Johnson 1974 Fast algorithms for bin packing J. Comput. Syst. Sci. 8 272 314 0284.68023
17. D.S. Johnson A. Demers J.D. Ullman M.R. Garey R.L. Graham 1974 Worst-case performance bounds for simple one-dimensional packing algorithms SIAM J. Comput. 3 256 278 10.1137/0203025 434396
18. Karmarkar, N., Karp, R.M.: An efficient approximation scheme for the one-dimensional bin-packing problem. In: Proceedings of the 23rd Annual Symposium on Foundations of Computer Science (FOCS'82), pp. 312-320 (1982)
19. C.C. Lee D.T. Lee 1985 A simple online bin packing algorithm J. ACM 32 3 562 572 0629.68045
20. P. Ramanan D.J. Brown C.C. Lee D.T. Lee 1989 Online bin packing in linear time J. Algorithms 10 305 326 0682.68057 10.1016/0196-6774(89)90031-X 1006988
21. S.S. Seiden 2002 On the online bin packing problem J. ACM 49 5 640 671 2147095
22. D. Simchi-Levi 1994 New worst-case results for the bin-packing problem Naval Res. Logist. 41 4 579 585 0809.90111 10.1002/1520-6750(199406)41:4<579: :AID-NAV3220410409>3.0.CO;2-G 1279772
23. Ullman, J.D.: The performance of a memory allocation algorithm. Technical Report 100, Princeton University, Princeton, NJ (1971)
24. A. van Vliet 1992 An improved lower bound for online bin packing algorithms Inf. Process. Lett. 43 5 277 284 0764.68083 10.1016/0020-0190(92) 90223-I (Pubitemid 23575936)
25. A.C.C. Yao 1980 New algorithms for bin packing J. ACM 27 207 227 0434.68053
26. M. Yue 1991 A simple proof of the inequality FFD(L)≤(11/9)OPT(L)+1, L, for the FFD bin-packing algorithm Acta Math. Appl. Sin. 7 321 331 0753.05022 10.1007/BF02009683
27. Zhang, G.: Private communication
28. G. Zhang X. Cai C.K. Wong 2000 Linear time approximation algorithms for bin packing Oper. Res. Lett. 26 217 222 0960.90096 10.1016/S0167-6377(99)00077-2 1784601 (Pubitemid 30930753)