Tight absolute bound for First Fit Decreasing bin-packing:
- 1 October 2013
- journal article
- research article
- Published by Elsevier BV in Theoretical Computer Science
- Vol. 510, 13-61
- https://doi.org/10.1016/j.tcs.2013.09.007
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- On the machine scheduling problem with job delivery coordinationEuropean Journal of Operational Research, 2007
- A tighter bound for FFd algorithmActa Mathematicae Applicatae Sinica, English Series, 2000
- A simple proof of the inequality FFD (L) ≤ 11/9 OPT (L) + 1, ∀L for the FFD bin-packing algorithmActa Mathematicae Applicatae Sinica, English Series, 1991
- A new proof for the first-fit decreasing bin-packing algorithmJournal of Algorithms, 1985