Approximation Algorithms for Bin-Packing — An Updated Survey

This paper updates a survey [53] written about 3 years ago. All of the results mentioned there are covered here as well. However, as a major justification for this second edition we shall be presenting many new results, some of which represent important advances. As a measure of the impressive amount of research in just 3 years, the present reference list more than doubles the list in [53].

[1]  Daniel J. Kleitman,et al.  An optimal bound for two dimensional bin packing , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[2]  Joseph Y.-T. Leung,et al.  Combinatorial analysis of an efficient algorithm for processor and storage allocation , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[3]  Ronald L. Graham,et al.  Bounds for certain multiprocessing anomalies , 1966 .

[4]  Chak-Kuen Wong,et al.  Bin Packing with Geometric Constraints in Computer Network Design , 1978, Oper. Res..

[5]  Brenda S. Baker,et al.  Shelf Algorithms for Two-Dimensional Packing Problems , 1983, SIAM J. Comput..

[6]  Chak-Kuen Wong,et al.  On the Optimality of the Probability Ranking Scheme in Storage Applications , 1973, JACM.

[7]  Ronald L. Graham,et al.  Bounds on multiprocessing anomalies and related packing algorithms , 1972, AFIPS '72 (Spring).

[8]  Edward G. Coffman,et al.  On the Expected Relative Performance of List Scheduling , 1985, Oper. Res..

[9]  M. T. Kaufman,et al.  An Almost-Optimal Algorithm for the Assembly Line Scheduling Problem , 1974, IEEE Transactions on Computers.

[10]  Richard M. Karp,et al.  An efficient approximation scheme for the one-dimensional bin-packing problem , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[11]  E. G. Coffman,et al.  An Introduction to Proof Techniques for Bin-Packing Approximation Algorithms , 1982 .

[12]  Ronald L. Graham,et al.  Bounds for Multiprocessor Scheduling with Resource Constraints , 1975, SIAM J. Comput..

[13]  Micha Hofri,et al.  A Stochastic Model of Bin-Packing , 1980, Inf. Control..

[14]  N. Karmarkar.  Probabilistic analysis of some bin-packing problems , 1982, FOCS 1982.

[15]  D. K. Friesen,et al.  SCHEDULING TO MAXIMIZE THE MINIMUM PROCESSOR FINISH TIME IN A MULTIPROCESSOR SYSTEM , 1982 .

[16]  Edward G. Coffman,et al.  An Application of Bin-Packing to Multiprocessor Scheduling , 1978, SIAM J. Comput..

[17]  Michael A. Langston,et al.  Improved 0/1-interchange scheduling , 1982, BIT.

[18]  Chak-Kuen Wong,et al.  The Effect of a Capacity Constraint on the Minimal Cost of a Partition , 1975, JACM.

[19]  George S. Lueker,et al.  Bin packing with items uniformly distributed over intervals [a,b] , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[20]  Chak-Kuen Wong,et al.  Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation , 1975, SIAM J. Comput..

[21]  Paul Erdös,et al.  On Packing Squares with Equal Squares , 1975, J. Comb. Theory, Ser. A.

[22]  Jr. E. G. Coffman.  An Introduction to Combinatorial Models of Dynamic Storage Allocation , 1983 .

[23]  Richard M. Karp,et al.  The Differencing Method of Set Partitioning , 1983 .

[24]  Donna J. Brown,et al.  A Lower Bound for On-Line One-Dimensional Bin Packing Algorithms. , 1979 .

[25]  Jeffrey D. Ullman,et al.  Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms , 1974, SIAM J. Comput..

[26]  Herb Schwetman,et al.  Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems , 1975, JACM.

[27]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[28]  Greg N. Frederickson,et al.  Probabilistic Analysis for Simple One- and Two-Dimensional Bin Packing Algorithms , 1980, Inf. Process. Lett..

[29]  John Michael Robson,et al.  Bounds for Some Functions Concerning Dynamic Storage Allocation , 1974, JACM.

[30]  Brenda S. Baker,et al.  A 5/4 Algorithm for Two-Dimensional Packing , 1981, J. Algorithms.

[31]  B. J. Lageweg,et al.  Analytical Evaluation of Hierarchical Planning Systems , 1981, Oper. Res..

[32]  David S. Johnson.  The NP-Completeness Column: An Ongoing Guide , 1986, J. Algorithms.

[33]  Edward G. Coffman,et al.  Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle , 1983 .

[34]  Raymond E. Miller,et al.  Complexity of Computer Computations , 1972 .

[35]  Donna J. Brown,et al.  An Improved BL Lower Bound , 1980, Inf. Process. Lett..

[36]  Frank M. Liang.  A Lower Bound for On-Line Bin Packing , 1980, Inf. Process. Lett..

[37]  R. Gomory,et al.  A Linear Programming Approach to the Cutting-Stock Problem , 1961 .

[38]  Edward G. Coffman,et al.  A generalized bound on LPT sequencing , 1976, SIGMETRICS '76.

[39]  B. J. Lageweg,et al.  Analysis of Heuristics for Stochastic Programming: Results for Hierarchical Scheduling Problems , 1983, Math. Oper. Res..

[40]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[41]  Nicos Christofides,et al.  An Algorithm for Two-Dimensional Cutting Problems , 1977, Oper. Res..

[42]  Brenda S. Baker,et al.  A New Proof for the First-Fit Decreasing Bin-Packing Algorithm , 1985, J. Algorithms.

[43]  Ronald L. Rivest,et al.  Orthogonal Packings in Two Dimensions , 1980, SIAM J. Comput..

[44]  Daniel Dominic Sleator,et al.  A 2.5 Times Optimal Algorithm for Packing in Two Dimensions , 1980, Inf. Process. Lett..

[45]  D. S. Johnson,et al.  On Packing Two-Dimensional Bins , 1982 .

[46]  George Markowsky,et al.  Multidimensional Bin Packing Algorithms , 1977, IBM J. Res. Dev..

[47]  Giorgio Ausiello,et al.  Analysis and design of algorithms in combinatorial optimization , 1981 .

[48]  G. S. Lueker,et al.  Bin packing can be solved within 1 + ε in linear time , 1981 .

[49]  D. K. Friesen,et al.  Sensitivity Analysis for Heuristic Algorithms , 1978 .

[50]  Ellis Horowitz,et al.  A linear time approximation algorithm for multiprocessor scheduling , 1979 .

[51]  Joseph F. Traub,et al.  Algorithms and Complexity: New Directions and Recent Results , 1976 .

[52]  David S. Johnson,et al.  Fast Algorithms for Bin Packing , 1974, J. Comput. Syst. Sci..

[53]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[54]  Igal Golan,et al.  Performance Bounds for Orthogonal Oriented Two-Dimensional Packing Algorithms , 1981, SIAM J. Comput..

[55]  Stephen D. Shapiro,et al.  Performance of Heuristic Bin Packing Algorithms with Segments of Random Length , 1977, Inf. Control..

[56]  Richard Loulou,et al.  Tight Bounds and Probabilistic Analysis of Two Heuristics for Parallel Processor Scheduling , 1984, Math. Oper. Res..

[57]  E. G. Coffman,et al.  A Note on Expected Makespans for Largest-First Sequences of Independent Tasks on Two Processors , 1984, Math. Oper. Res..

[58]  James B. Shearer.  A Counterexample to a Bin Packing Conjecture , 1981 .

[59]  Edward G. Coffman,et al.  Dynamic, First-Fit Packings in Two or More Dimensions , 1984, Inf. Control..

[60]  G. S. Lueker.  An average-case analysis of bin packing with uniformly distributed item sizes , 1982 .

[61]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems: an annotated bibliography , 1976 .

[62]  Michael J. Magazine,et al.  Probabilistic Analysis of Bin Packing Heuristics , 1984, Oper. Res..

[63]  Antonio Albano,et al.  Optimal Allocation of Two-Dimensional Irregular Shapes Using Heuristic Search Methods , 1980, IEEE Transactions on Systems, Man, and Cybernetics.

[64]  Joseph Y.-T. Leung,et al.  On a Dual Version of the One-Dimensional Bin Packing Problem , 1984, J. Algorithms.

[65]  Michael J. Magazine,et al.  Assembly line balancing as generalized bin packing , 1982, Oper. Res. Lett..

[66]  David S. Johnson,et al.  Near-optimal bin packing algorithms , 1973 .

[67]  Edward G. Coffman,et al.  Dynamic Bin Packing , 1983, SIAM J. Comput..

[68]  Robert E. Tarjan,et al.  Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms , 1980, SIAM J. Comput..

[69]  Sartaj Sahni,et al.  Algorithms for Scheduling Independent Tasks , 1976, J. ACM.

[70]  R. Gomory,et al.  Multistage Cutting Stock Problems of Two and More Dimensions , 1965 .

[71]  Micha Hofri.  Two-Dimensional Packing: Expected Performance of Simple Level Algorithms , 1980, Inf. Control..

[72]  Edward G. Coffman,et al.  Record Allocation for Minimizing Expected Retrieval Costs on Drum-Like Storage Devices , 1976, J. ACM.

[73]  Andrew Chi-Chih Yao,et al.  New Algorithms for Bin Packing , 1978, JACM.

[74]  Walter Knödel,et al.  A Bin Packing Algorithm with Complexity O(n log n) and Performance 1 in the Stochastic Limit , 1981, MFCS.

[75]  David S. Johnson,et al.  Approximation Algorithms for Bin Packing Problems: A Survey , 1981 .

[76]  Richard M. Karp,et al.  A probabilistic analysis of multidimensional bin packing problems , 1984, STOC '84.

[77]  Edward G. Coffman,et al.  A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-Packing , 1981 .

[78]  Andrew Chi-Chih Yao,et al.  Resource Constrained Scheduling as Generalized Bin Packing , 1976, J. Comb. Theory A.

[79]  John Michael Robson,et al.  Worst Case Fragmentation of First Fit and Best Fit Storage Allocation Strategies , 1977, Comput. J..

[80]  Ralph E. Gomory,et al.  A Linear Programming Approach to the Cutting Stock Problem---Part II , 1963 .