Bin-packing problem with concave costs of bin utilization

Naval Research Logistics

Volumn 53, Issue 4, 2006, Pages 298-308

  Li, Chung Lun ^a   Chen, Zhi Long ^b  

^a HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^b UNIVERSITY OF MARYLAND   (United States)

Author keywords

Bin packing; Concavity; Worst case analysis

Indexed keywords

COMPUTATION THEORY; COSTS; FUNCTION EVALUATION; HEURISTIC METHODS; MATHEMATICAL MODELS;

BIN PACKING; CONCAVITY; WORST-CASE ANALYSIS;

PROBLEM SOLVING;

EID: 33646267443     PISSN: 0894069X     EISSN: 15206750     Source Type: Journal    
DOI: 10.1002/nav.20142     Document Type: Article

References (29)

1. S. Anily, J. Bramel, and D. Simchi-Levi, Worst-case analysis of heuristics for the bin packing problem with general cost structures, Oper Res 42 (1994), 287-298.
2. S. Anily and A. Federgruen, Structured partitioning problems. Oper Res 39 (1991), 130-149.
3. L. Argote and D. Epple, Learning curves in manufacturing, Science 247 (1990), 920-924.
4. B.S. Baker, A new proof for the first-fit decreasing bin packing algorithm, J Algor 6 (1985), 49-70.
5. E.R. Barnes, A.J. Hoffman, and U.G. Rothblum, Optimal partitions having disjoint convex and conic hulls, Math Program 54 (1992), 69-86.
6. J. Bramel, W.T. Rhee, and D. Simchi-Levi, Average-case analysis of the bin-packing problem with general cost structures, Nav Res Logist 44 (1997), 673-686.
7. A.K. Chakravarty, J.B. Orlin, and U.G. Rothblum, A partitioning problem with additive objective with an application to optimal inventory groupings for joint replenishment, Oper Res 30 (1982), 1018-1020.
8. A.K. Chakravarty, J.B. Orlin, and U.G. Rothblum, Consecutive optimizers for a partitioning problem with applications to optimal inventory groupings for joint replenishment, Oper Res 33 (1985), 820-834.
9. L.M.A. Chan, D. Simchi-Levi, and J. Bramel, Worst-case analysis, linear programming and the bin packing problem, Math Program 83 (1998), 213-227.
10. H.-Y. Chao, M.P. Harper, and R.W. Quong, A tight lower bound for optimal bin packing, Oper Res Lett 18 (1995), 133-138.
11. C. Chu and R. La, Variable-sized bin packing: Tight absolute worst-case performance ratios for four approximation algorithms, SIAM J Comput 30 (2001), 2069-2083.
12. E.G. Coffman, Jr., M.R. Garey, and D.S. Johnson, "Approximation algorithms for bin packing: a survey," Approximation algorithms for NP-hard problems, D.S. Hochbaum (Editor), PWS Publishing, Boston, 1997, pp. 46-93.
13. R.J. Ebert, Aggregate planning with learning curve productivity, Manage Sci 23 (1976), 171-182.
14. S.P. Fekete and J. Schepers, New classes of fast lower bounds for bin packing problems, Math Program 91 (2001), 11-31.
15. K. Fleszar and K.S. Hindi, New heuristics for one-dimensional bin-packing, Comput Oper Res 29 (2002), 821-839.
16. S. Gal and B. Klots, Optimal partitioning which maximizes the sum of the weighted averages, Oper Res 43 (1995), 500-508.
17. M.R. Garey, R.L. Graham, D.S. Johnson, and A.C. Yao, Resource constrained scheduling as generalized bin packing, J Combinator Theor A 21 (1985), 257-298.
18. J.N.D. Gupta and J.C. Ho, A new heuristic algorithm for the one-dimensional bin-packing problem, Prod Plan Contr 10 (1999), 598-603.
19. D.S. Johnson, A. Demers, J.D. Ullman, M.R. Garey, and R.L. Graham, Worst-case performance bounds for simple one-dimensional packing algorithms, SIAM J Comput 3 (1974), 299-325.
20. J. Kang and S. Park, Algorithms for the variable sized bin packing problem, Eur J Oper Res 147 (2003), 365-372.
21. J.Y.-T. Leung, M. Dror, and G.H. Young, A note on open-end bin packing problem, J Schedul 4 (2001), 201-207.
22. H.L. Ong, M.J. Magazine, and T.S. Wee, Probabilistic analysis of bin packing heuristics, Oper Res 32 (1984), 983-998.
23. C. Reeves, Hybrid genetic algorithms for bin-packing and related problems, Ann Oper Res 63 (1996), 371-396.
24. A. Scholl, R. Klein, and C. Jurgens, BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem, Comput Oper Res 24 (1997), 627-645.
25. P. Schwerin and G. Wascher, The bin-packing problem: A problem generator and some numerical experiments with FFD packing and MIR, Int Trans Oper Res 4 (1997), 377-389.
26. D. Simchi-Levi, New worst-case results for the bin-packing problem, Nav Res Logist 41 (1994), 579-585.
27. J.M. Valerio de Carvalho, Exact solution of bin-packing problems using column generation and branch-and-bound, Ann Oper Res 86 (1999), 629-659.
28. F. Vanderbeck, Computational study of a column generation algorithm for bin packing and cutting stock problems, Math Program A 86 (1999), 565-594.
29. J. Yang and J.Y.-T. Leung, The ordered open-end bin packing problem, Oper Res 51 (2003), 759-770.