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.
KeywordsInformation System Operating System Data Structure Communication Network Information Theory
Unable to display preview. Download preview PDF.
- 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.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.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.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