×

Bin packing: Maximizing the number of pieces packed. (English) Zbl 0421.68065


MSC:

68R99 Discrete mathematics in relation to computer science
68Q25 Analysis of algorithms and problem complexity
68N99 Theory of software

Citations:

Zbl 0364.68042
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Coffman, E.G., Garey, M.R., Johnson, D.S.: An application of bin-packing to multiprocessor scheduling. SIAM J. Comput. (to appear) · Zbl 0374.68032
[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., 1976 · Zbl 0421.68065
[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 1976
[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) · Zbl 0297.68028 · doi:10.1137/0203025
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.