More on online bin packing with two item sizes

DOI10.1016/j.disopt.2008.04.003zbMath1151.90500OpenAlexW1974455577MaRDI QIDQ955329

Leah Epstein, Asaf Levin

Publication date: 19 November 2008

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2008.04.003

zbMATH Keywords

online algorithmsbin packing

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (6)

Tight Bounds for Restricted Grid Scheduling ⋮ Online bin packing problem with buffer and bounded size revisited ⋮ Improved lower bounds for semi-online bin packing problems ⋮ Bounds for Scheduling Jobs on Grid Processors ⋮ NF-Based Algorithms for Online Bin Packing with Buffer and Item Size Limitation ⋮ NF-based algorithms for online bin packing with buffer and bounded item size

Cites Work

• Unnamed Item
• Unnamed Item
• A lower bound for on-line bin packing
• Does randomization help in on-line bin packing?
• An improved lower bound for on-line bin packing algorithms
• Batched bin packing
• Fast algorithms for bin packing
• A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths
• The Parametric Behavior of the First-Fit Decreasing Bin Packing Algorithm
• On the online bin packing problem
• A simple on-line bin-packing algorithm
• New Algorithms for Bin Packing
• A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-Packing
• On-line bin packing in linear time

This page was built for publication: More on online bin packing with two item sizes