An on-line algorithm for variable-sized bin packing

DOI10.1007/BF00289157zbMath0689.68047OpenAlexW2056716554WikidataQ105583286 ScholiaQ105583286MaRDI QIDQ582083

János A. Csirik

Publication date: 1989

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00289157

zbMATH Keywords

variable-sized bin packingasymptotical worst-case ratioHarmonic Fit

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Related Items (10)

Online bin packing with overload cost ⋮ On-line bin packing ? A restricted survey ⋮ A new version of on-line variable-sized bin packing ⋮ A bin packing approach to solve the aircraft maintenance task allocation problem ⋮ Bin packing with controllable item sizes ⋮ Variable sized online interval coloring with bandwidth ⋮ A \(17/10\)-approximation algorithm for \(k\)-bounded space on-line variable-sized bin packing ⋮ The variable-width strip packing problem ⋮ Online Bin Packing with (1,1) and (2,R) Bins ⋮ Online bin packing with \((1,1)\) and \((2,R)\) bins

Cites Work

• A storage-size selection problem
• Online variable-sized bin packing
• A lower bound for on-line bin packing
• Variable Sized Bin Packing
• An Efficient Approximation Scheme for Variable-Sized Bin Packing
• A simple on-line bin-packing algorithm

This page was built for publication: An on-line algorithm for variable-sized bin packing