Abstract
Bin packing problems, in which one is asked to pack items of various sizes into bins so as to optimize some given objective function, arise in a wide variety of contexts and have been studied extensively during the past ten years, primarily with the goal of finding fast “approximation algorithms” that construct near-optimal packings. Beginning with the classical one-dimensional bin packing problem first studied in the early 1970’s, we survey the approximation results that have been obtained for this problem and its many variants and generalizations, including recent (unpublished) work that reflects the currently most active areas of bin packing research. Our emphasis is on the worst-case performance guarantees that have been proved, but we also discuss work that has been done on expected performance and behavior “in practice,” as well as mentioning some of the many applications of these problems.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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
Baker, B. S., private communication (1979).
Baker, B. S., Brown, D. J., and Katseff, H. P., “Lower bounds for on-line modimensional packing algorithms,” Proc. 1979 Conf. on Information Sci. and Systems. Dept. of Electrical Eng., Johns Hopkins University, Baltimore, MD (1979), 174–179.
Baker, B. S., Brown, D. J., and Katseff, H. P., “A 5/4 algorithm for two-dimensional packing,” (to appear).
Baker, B. S. and Coffman, E. G., Jr., “A tight asymptotic bound for next-fitdecreasing bin packing,” (to appear).
Baker, B. S., Coffman, E. G., Jr., and Rivest, R. L., “Orthogonal packings in two dimensions,” SIAM J. Comput. (to appear).
Baker, B. S. and Schwarz, J. S., “Shelf algorithms for two-dimensional packing problems,” Proc. 1979 Conf. on Information Sci. and Systems, Dept. of Electrical Eng., Johns Hopkins University, Baltimore, MD (1979), 273–276.
Brown, A. R., Optimum Packing and Depletion, American Elsevier, New York (1971).
Brown, D. J., “A lower bound for on-line one-dimensional bin packing algorithms,” Technical Report R-864 (1979), Coordinated Science Laboratory, University of Minois, Urbana, IL.
Brown, D. J., private communication (1980).
Chandra, A. K. and Wong, C. K., “Worst-case analysis of a placement algorithm related to storage allocation,” SIAM J. Comput. 4 (1975), 249–263.
Chandra, A. K., Hirschberg, D. S., and Wong, C. K., “Bin packing with geometric constraints in computer network design,” Computer Science Research Report RC 6895 (1977), IBM Research Center, Yorktown Heights, New York.
Coffman, E. G., Jr., Garey, M. R., and Johnson, D. S., “An application of bin-packing to multiprocessor scheduling,” SIAM J. Comput. 7 (1978), 1–17.
Coffman, E. G., Jr, Garey, M. R., and Johnson, D. S., “Dynamic bin packing,” (to appear).
Coffman, E. G., Jr., Garey, M. R., Johnson, D. S., and Tarjan, R. E., “Performance bounds for level-oriented two-dimensional packing algorithms,” SIAM J. Comput. (to appear).
Coffman, E. G., Jr., Hofri, M., and So, K., “A stochastic model of bin packing,” (to appear).
Coffman, E. G., Jr., and Leung, J. Y., “Combinatorial analysis of an efficient algorithm for processor and storage allocation,” SIAM J. Comput. 8 (1979), 202–217.
Coffman, E. G., Jr., Leung, J. Y., and Ting, D. W., “Bin packing: maximizing the number of pieces packed,” Acta Informatica 9 (1978), 263–271.
Easton, M. C. and Wong, C. K., “The effect of a capacity constraint on the minimal cost of a partition,” J. Assoc. Comput. Mach. 22 (1975), 441–449.
Erdös, P. and Graham, R. L., “On packing squares with equal squares,” J. Combinatorial Theory Ser. A 19 (1975), 119–123.
Frederickson, G. N., “Probabilistic analysis for simple one-and two-dimensional bin packing algorithms,” (to appear).
Friesen, D. K., “Sensitivity analysis for heuristic algorithms,” Technical Report UIUCDCS-R-78–939 (1978), Dept. Comp. Sci., Univ. of Illinois, Urbana, IL.
Garey, M. R. and Graham, R. L., “Bounds on multiprocessor scheduling with resource constraints,” SIAM J. Comput. 4 (1974), 187–200.
Garey, M. R., Graham, R. L., and Johnson, D. S., “On a number-theoretic bin packing conjecture,” Proc. 5th Hungarian Combinatorics Colloquium, North-Holland, Amsterdam (1978), 377–392.
Garey, M. R., Graham, R. L., Johnson, D. S., and Yao, A. C., “Resource constrained scheduling as generalized bin packing,” J. Combinatorial Theory Ser. A 21 (1976), 257–298.
Garey, M. R. and Johnson, D. S., “Approximation algorithms for combinatorial problems: an annotated bibliography,” in J. F. Traub (ed.), Algorithms and Complexity: New Directions and Recent Results, Academic Press, New York (1976), 41–52.
Garey, M. ‘R. and Johnson, D. S., Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Co., San Francisco (1979).
Garey, M. R. and Johnson, D. S., in preparation.
Gilmore, P. C. and Gomory, R. E., “A linear programming approach to the cutting stock problem,” Operations Res. 9 (1961), 849–859.
Gilmore, P. C. and Gomory, R. E., “A linear programming approach to the cutting stock problem–Part II,” Operations Res. 11 (1963), 863–888.
Golan, I., “Orthogonal oriented algorithms for packing in two dimension,” Draft (1978).
Graham, R. L., “Bounds for certain multiprocessing anomalies,” Bell System Tech. J. 45 (1966), 1563–1581.
Graham, R. L., “Bounds on multiprocessing timing anomalies,” SIAM J. Appl. Math. 17 (1969), 263–269.
Graham, R. L., “Bounds on multiprocessing anomalies and related packing algorithms,” Proc. 1972 Spring Joint Computer Conference, AFIPS Press, Montvale. NJ (1972), 205–217.
Graham, R. L., “Bounds on performance of scheduling algorithms,” in E. G. Coffman, Jr. (ed.), Computer and Job-Shop Scheduling Theory, John Wiley & Son,. New York (1976), 165–227.
Graham, R. L., Lawler, E. L., Lenstra, J. K., and Rinnooy Kan, A. H. G., “Optimization and approximation in deterministic sequencing and scheduling: a survie’ Annals Disc. Math. 5 (1979), 287–326.
Hofri, M., “1.5 dimensional packing: expected performance of simple level algorithms,” Technical Report No. 147 (1979), Dept. Computer Science, Technion. Haifa, Israel.
Johnson, D. S., “Near-optimal bin packing algorithms,” Technical Report MAC TR-109 (1973), Project MAC, Massachusetts Institute of Technology, Cambridge, Mass.
Johnson, D. S., “Fast algorithms for bin packing,” J. Comput. Syst. Sci. 8 (1974), 272–314.
Johnson, D. S., Demers, A., Ullman, J. D., Garey, M. R., and Graham, R. L., “Worst-case performance bounds for simple one-dimensional packing algorithms,” SIAM J. Comput. 3 (1974), 299–325.
Karp, R. M., “Reducibility among combinatorial problems,” in R. E. Miller and J. W. Thatcher (ed.), Complexity of Computer Computations, Plenum Press, New York (1972), 85–103.
Kaufman, M. T., “An almost-optimal algorithm for the assembly line scheduling problem,” IEEE Trans. Computers C-23 (1974), 1169–1174.
Kleitman, D. J. and Krieger, M. K., “An optimal bound for two dimensional bin packing,” Proc. 16th Ann. Symp. on Foundations of Computer Science, IEEE Computer Society, Long Beach, CA (1975), 163–168.
Kou, L. T. and Markowsky, G., “Multidimensional bin packing algorithms,” IBM J. Res. & Del,. 21 (1977), 443–448.
Krause, K. L., Shen, Y. Y., and Schwetman, H. D., “Analysis of several task-scheduling algorithms for a model of multiprogramming computer systems,” J. Assoc. Comput. Mach. 22 (1975), 522–550.
Liang, F. M., “A lower bound for on-line bin packing,” Information Processing Len. 10 (1980), 76–79.
Magazine, M. J. and Wee, T. S., “The generalization of bin-packing heuristics to the line balancing problem,” Working Paper No. 128 (1979), Dept. Mgmt. Sci., University of Waterloo, Waterloo, Ontario.
Maruyama, K., Chang, S. K., and Tang, D. T., “A general packing algorithm for multidimensional resource requirements,” Internat. J. Comput. Infor. Sci. 6 (1977), 131–149.
Salmi, S., “Algorithms for scheduling independent tasks,” J. Assoc. Comp. Mach. 23 (1976), 116–127.
Shapiro, S. D., “Performance of heuristic bin packing algorithms with segments of random length,” Information and Control 35 (1977), 146–148.
Sleator, D. K. D. B., “A 2.5 times optimal algorithm for bin packing in two dimensions,” Information Processing Lett. 10 (1980), 37–40.
Taylor, D. B., “Container stacking: an application of mathematical programming,” Draft (1979).
Wong, C. K. and Yao, A. C., “A combinatorial optimization problem related to data set allocation,” Rev. Francaise Automat. Informar. Recherche Operationelle Ser. Bleue 105 (stippl.) (1976), 83–95:
Yao, A. C., “New algorithms for bin packing” J. Assoc. Comput. Mach. 27 (1980), 207–227.
Yue, P. C. and Wong, C. K., “On the optimality of the probability ranking scheme in storage applications,” J. Assoc. Comput. Mach. 20 (1973), 624–633.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1981 Springer-Verlag Wien
About this chapter
Cite this chapter
Garey, M.R., Johnson, D.S. (1981). Approximation Algorithms for Bin Packing Problems: A Survey. In: Ausiello, G., Lucertini, M. (eds) Analysis and Design of Algorithms in Combinatorial Optimization. International Centre for Mechanical Sciences, vol 266. Springer, Vienna. https://doi.org/10.1007/978-3-7091-2748-3_8
Download citation
DOI: https://doi.org/10.1007/978-3-7091-2748-3_8
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-81626-4
Online ISBN: 978-3-7091-2748-3
eBook Packages: Springer Book Archive