Answers are grounded in this paper and cite their sources.
In this note we consider the familiar bin-packing problem and provide new worst-case results for a number of classical heuristics. We show that the first-fit and best-fit heuristics have an absolute performance ratio of no more than 1.75, and first-fit decreasing and best-fit decreasing heuristics have an absolute performance ratio of 1.5. The latter is the best possible absolute performance ratio for the bin-packing problem, unless P = NP.
No takes yet. Share an insight, caveat, or question.
David Simchi‐Levi (1994) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: