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

DOI10.1007/BF02309343MaRDI QIDQ1909600zbMATH OpenFDO

Authors Yanyan Li

Publication date 17 March 1996

Published in Computing (Search for Journal in Brave)

zbMATH Keywords

bin packingonline algorithmFFH algorithmright worst-case performance bound

Mathematics Subject Classification ID

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

Recommendations

• An on-line algorithm for variable-sized bin packing
• Online variable-sized bin packing
• A new version of on-line variable-sized bin packing
• The Asymptotic Worst-Case Behavior of the FFD Heuristic for Small Items

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

Cited in

(5)

• The Asymptotic Worst-Case Behavior of the FFD Heuristic for Small Items
• A new version of on-line variable-sized bin packing
• A \(17/10\)-approximation algorithm for \(k\)-bounded space on-line variable-sized bin packing
• Relaxations and exact solution of the variable sized bin packing problem
• A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1909600)