A Packing Problem You Can Almost Solve by Sitting on Your Suitcase

DOI10.1137/0607028zbMath0589.90042OpenAlexW2066284144MaRDI QIDQ3718472

David B. Shmoys, Dorit S. Hochbaum

Publication date: 1986

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

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

zbMATH Keywords

machine schedulingbin-packingapproximation of solutionsminimum makespandual approximation algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An Application of Bin-Packing to Multiprocessor Scheduling
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies

This page was built for publication: A Packing Problem You Can Almost Solve by Sitting on Your Suitcase