Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation

DOI10.1137/0208016zbMATH Open0417.68022OpenAlexW2012067948MaRDI QIDQ3208073FDOQ3208073

Authors: Joseph Y.-T. Leung, E. G. jun. Coffman 

Publication date: 1979

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0208016

zbMATH Keywords

approximation algorithmsschedulingbin-packingcombinatorial algorithmsNp-completenessworst-case time complexityprocessor and storage allocationworst- case performance bounds

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cited In (8)

• Bin packing with restricted piece sizes
• Bin packing with divisible item sizes
• A state-of-the-art review of parallel-machine scheduling research
• Lower bounds and algorithms for the minimum cardinality bin covering problem
• Upper bounds and algorithms for the maximum cardinality bin packing problem.
• Probabilistic analysis of a heuristic for the dual bin packing problem
• Performance of Heuristics for a Computer Resource Allocation Problem
• Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle

This page was built for publication: Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3208073)