Acta Mathematicae Applicatae Sinica

, Volume 7, Issue 4, pp 321–331

A simple proof of the inequality FFD (L) ≤ 11/9 OPT (L) + 1, ∀L for the FFD bin-packing algorithm

  • Yue Minyi 

DOI: 10.1007/BF02009683

Cite this article as:
Yue, M. Acta Mathematicae Applicatae Sinica (1991) 7: 321. doi:10.1007/BF02009683


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[1] showed that for every listL, FFD(L)≤11/9OPT(L)+4. His proof required more than 100 pages. Later, Baker[2] 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.

Copyright information

© Science Press, Beijing, China and Allerton Press, Inc., New York, U.S.A. 1991

Authors and Affiliations

  • Yue Minyi 
    • 1
    • 2
  1. 1.Institute of Applied MathematicsAcademia SinicaBeijing
  2. 2.Forschungsinstitut für Diskrete MathematikBonn