Advertisement

Acta Informatica

, Volume 9, Issue 3, pp 263–271 | Cite as

Bin packing: Maximizing the number of pieces packed

  • E. G. CoffmanJr.
  • J. Y. -T. Leung
  • D. W. Ting
Article

Summary

We consider a variant of the classical one-dimensional bin-packing problem: The number of bins is fixed and the object is to maximize the number of pieces packed from some given set. Both problems have applications in processor and storage allocation in computer systems in addition to a broad application in operations research.

It can easily be shown that both problems are NP-complete; our approach will be to propose and analyze very fast heuristics. We consider a class of algorithms and bound the performance of an arbitrary algorithm in that class. Finally we propose an algorithm, the first-fit-increasing algorithm, and analyze its running time and relative performance.

Keywords

Information System Operating System Data Structure Communication Network Information Theory 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Coffman, E.G., Garey, M.R., Johnson, D.S.: An application of bin-packing to multiprocessor scheduling. SIAM J. Comput. (to appear)Google Scholar
  2. 2.
    Coffman, E.G., Jr., Leung, J.Y-T., Ting, D.: Bin-packing: Maximizing the number of pieces packed. Technical Report, Computer Science Dept., The Pennsylvania State Univ., 1976Google Scholar
  3. 3.
    Graham, R.L.: Bounds on the performance of scheduling algorithms. In: Computer and job-shop scheduling theory (E.G. Coffman, ed.). New York:Wiley 1976Google Scholar
  4. 4.
    Johnson, D.S., Demers, A., Ullman, J.D., Garey, M.R., Graham, R.L.: Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J. Comput. 3 299–326 (1974)Google Scholar

Copyright information

© Springer-Verlag 1978

Authors and Affiliations

  • E. G. CoffmanJr.
    • 1
  • J. Y. -T. Leung
    • 2
  • D. W. Ting
    • 3
  1. 1.Department of Electrical Engineering and Computer ScienceColumbia UniversityNew YorkUSA
  2. 2.Computer Science DepartmentVirginia Polytechnic UniversityBlacksburgUSA
  3. 3.Bell LaboratoriesHolmdelUSA

Personalised recommendations