Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation

DOI10.1137/0208016zbMath0417.68022OpenAlexW2012067948MaRDI QIDQ3208073

Joseph Y.-T. Leung, Edward 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

schedulingapproximation algorithmscombinatorial algorithmsbin-packingNp-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)

Related Items (8)

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

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