Online bin packing with arbitrary release times
From MaRDI portal
Publication:2474079
Recommendations
- On-Line Bin Packing with Arbitrary Release Times
- Online Bin Packing with Cardinality Constraints
- Algorithms – ESA 2005
- On online bin packing with LIB constraints
- Online bin packing with cardinality constraints resolved
- Online bin packing with cardinality constraints resolved
- Online variable-sized bin packing with conflicts
- On-line bin packing in linear time
- scientific article; zbMATH DE number 1756012
- On the online bin packing problem
Cites work
- scientific article; zbMATH DE number 6118219 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2163021 (Why is no real title available?)
- An improved lower bound for on-line bin packing algorithms
- Approximation algorithms for NP-hard problems.
- On the online bin packing problem
- On-line scheduling for jobs with arbitrary release times
- Strip packing with precedence constraints and strip packing with release times
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
Cited in
(8)- Research on online bin packing model with item size no more than \(\frac{1}{2}\)
- An \(\mathcal O(\log m)\)-competitive algorithm for online machine minimization
- An improved algorithm for online machine minimization
- An asymptotic competitive scheme for online bin packing
- Algorithms for the relaxed online bin-packing model
- NF-based algorithms for online bin packing with buffer and item size limitation
- Online bin packing with delay and holding costs
- On-Line Bin Packing with Arbitrary Release Times
This page was built for publication: Online bin packing with arbitrary release times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2474079)
