A simple proof of the inequality FFD (L) ≤ 11/9 OPT (L) + 1, ∀L for the FFD bin-packing algorithm
- Minyi Yue
- … show all 1 hide
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.Get Access
The first fit decreasing (FFD) heuristic algorithm is one of the most famous and most studied methods for an approximative solution of the bin-packing problem. For a listL, let OPT(L) denote the minimal number of bins into whichL can be packed, and let FFD(L) denote the number of bins used by FFD. Johnson showed that for every listL, FFD(L)≤11/9OPT(L)+4. His proof required more than 100 pages. Later, Baker gave a much shorter and simpler proof for FFD(L)≤11/9 OPT(L)+3. His proof required 22 pages. In this paper, we give a proof for FFD(L)≤11/9 OPT(L)+1. The proof is much simpler than the previous ones.
- D.S. Johnson: Near-Optimal Bin-Packing Algorithms. Doctoral thesis, M.I.T., Cambridge, Mass., 1973.
- B.S. Baker: A New Proof for the First-Fit Decreasing Bin-Packing Algorithm,J. Algorithms,6 (1985), 49–70. CrossRef
- E.G. Coffman Jr., M.R. Garey and D.S. Johnson: An Application of Bin-Packing to Multiprocessor Scheduling,SIAM J. Comput,7 (1987), 1–17. CrossRef
- Minyi Yue: On the Exact Upper Bound for the Multifit Processor Scheduling Algorithm,Operations Research in China (ed. Minyi Yue), 233–260,Ann. Oper. Res.,24 (1990).
- A simple proof of the inequality FFD (L) ≤ 11/9 OPT (L) + 1, ∀L for the FFD bin-packing algorithm
Acta Mathematicae Applicatae Sinica
Volume 7, Issue 4 , pp 321-331
- Cover Date
- Print ISSN
- Online ISSN
- Additional Links
- Minyi Yue (1) (2)
- Author Affiliations
- 1. Institute of Applied Mathematics, Academia Sinica, Beijing
- 2. Forschungsinstitut für Diskrete Mathematik, Bonn