A new version of on-line variable-sized bin packing

DOI10.1016/S0166-218X(96)00018-2zbMath0869.90041OpenAlexW2056198897MaRDI QIDQ674434

Guo-Chuan Zhang

Publication date: 5 March 1997

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

on-line variable-sized bin packing problemworst-case performance bound

Mathematics Subject Classification ID

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

Related Items (8)

An iterated greedy algorithm for the planning of yarn‐dyeing boilers ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ Online variable-sized bin packing with conflicts ⋮ Tight Bounds for Restricted Grid Scheduling ⋮ Scheduling jobs on grid processors ⋮ The FFD algorithm for the bin packing problem with kernel items ⋮ Cutting optimization with variable-sized stock and inventory status data ⋮ Bounds for Scheduling Jobs on Grid Processors

Cites Work

• Unnamed Item
• An on-line algorithm for variable-sized bin packing
• Online variable-sized bin packing
• Worst-case analysis of the FFH algorithm for online variable-sized bin packing
• Variable Sized Bin Packing
• A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-Packing
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
• On-line bin packing ? A restricted survey

This page was built for publication: A new version of on-line variable-sized bin packing