The FFD algorithm for the bin packing problem with kernel items

DOI10.1007/s11766-998-0027-1zbMath0913.90232OpenAlexW2323908296MaRDI QIDQ1272734

Enyu Yao, Guo-Chuan Zhang

Publication date: 17 May 1999

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11766-998-0027-1

zbMATH Keywords

bin packingfirst-fit-decreasingworst case performance ratiosFFD algorithmkernel items

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• A new version of on-line variable-sized bin packing
• Assembly line balancing as generalized bin packing
• A simple proof of the inequality \(\text{FFD}(L)\leq {11 \over 9} \text{OPT}(L)+1\), \(\forall L\) for the FFD bin-packing algorithm
• A new proof for the first-fit decreasing bin-packing algorithm

This page was built for publication: The FFD algorithm for the bin packing problem with kernel items