Online bin packing with arbitrary release times

DOI10.1016/j.tcs.2007.10.023zbMath1134.68066OpenAlexW2110494434MaRDI QIDQ2474079

Yongqiang Shi, Deshi Ye

Publication date: 5 March 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.10.023

zbMATH Keywords

performance evaluationonline algorithmbin packing

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Combinatorial optimization (90C27)

Related Items (2)

An $\mathcal{O}(\log {m})$-Competitive Algorithm for Online Machine Minimization ⋮ An improved algorithm for online machine minimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strip packing with precedence constraints and strip packing with release times
• An improved lower bound for on-line bin packing algorithms
• On-line scheduling for jobs with arbitrary release times
• On the online bin packing problem
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms

This page was built for publication: Online bin packing with arbitrary release times