Parameterized on-line open-end bin packing

DOI10.1007/BF02684336zbMath0903.90104MaRDI QIDQ1387710

Guo-Chuan Zhang

Publication date: 8 June 1998

Published in: Computing (Search for Journal in Brave)

zbMATH Keywords

on-line algorithmsbin packingasymptotic worst-case performance ratio

Mathematics Subject Classification ID

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

Related Items (9)

On various open-end bin packing game ⋮ Open-end bin packing: new and old analysis approaches ⋮ A note on a variant of the online open end bin packing problem ⋮ Online minimization of the maximum starting time: migration helps ⋮ Asymptotic fully polynomial approximation schemes for variants of open-end bin packing ⋮ Hardness of lazy packing and covering ⋮ Starting time minimization for the maximum job variant ⋮ More on ordered open end bin packing ⋮ On lazy bin covering and packing problems

Cites Work

• Unnamed Item
• On a dual version of the one-dimensional bin packing problem
• A note on an open-end bin packing problem

This page was built for publication: Parameterized on-line open-end bin packing