Worst-case analysis of the FFH algorithm for online variable-sized bin packing

DOI10.1007/BF02309343zbMath0843.90060MaRDI QIDQ1909600

Yanyan Li

Publication date: 17 March 1996

Published in: Computing (Search for Journal in Brave)

zbMATH Keywords

online algorithmbin packingFFH algorithmright worst-case performance bound

Mathematics Subject Classification ID

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

Related Items (4)

A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts ⋮ A new version of on-line variable-sized bin packing ⋮ Relaxations and exact solution of the variable sized bin packing problem ⋮ A \(17/10\)-approximation algorithm for \(k\)-bounded space on-line variable-sized bin packing

Cites Work

• Online variable-sized bin packing
• Resource constrained scheduling as generalized bin packing
• Variable Sized Bin Packing
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms

This page was built for publication: Worst-case analysis of the FFH algorithm for online variable-sized bin packing