Batched bin packing revisited

DOI10.1007/S10951-015-0431-3MaRDI QIDQ2398649zbMATH OpenOpenAlexFDO

Authors György Dósa

Publication date 18 August 2017

Published in Journal of Scheduling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10951-015-0431-3

zbMATH Keywords

batched bin packinggraph-bin packingtight bound

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Batched bin packing
• More on batched bin packing
• Lower bounds for batched bin packing
• Lower bound for 3-batched bin packing
• Two-bounded-space bin packing revisited

Cites work

• A simple on-line bin-packing algorithm
• An approximation scheme for bin packing with conflicts
• An improved lower bound for on-line bin packing algorithms
• Batched bin packing
• Bin packing can be solved within 1+epsilon in linear time
• scientific article; zbMATH DE number 6678949 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Lower bound for 3-batched bin packing
• New lower bounds for certain classes of bin packing algorithms
• On Bin Packing with Conflicts
• On the online bin packing problem
• Optimal analysis of best fit bin packing
• The graph-bin packing problem
• Tight absolute bound for first fit decreasing bin-packing: \(\operatorname{FFD}(L)\leq 11/9 \operatorname{OPT}(L)+6/9\)

Cited in

(27)

• Approximation of the \(k\)-batch consolidation problem
• Deep performance analysis of refined harmonic bin packing algorithm
• Dynamic bin packing with unit fraction items revisited
• Lower bound for 3-batched bin packing
• Batch coloring of graphs
• Batched bin packing
• More on batched bin packing
• Packing batches of items into a single bin
• Lower bounds for batched bin packing
• Open-end bin packing: new and old analysis approaches
• On bin packing with clustering and bin packing with delays
• Packing items into several bins facilitates approximating the separable assignment problem
• Bin packing using semi-ordinal data
• Packing batches of cubes into a single bin
• Batch Coloring of Graphs
• Approximation of a batch consolidation problem
• scientific article; zbMATH DE number 3890754 (Why is no real title available?)
• Black and White Bin Packing Revisited
• Comments on the hierarchically structured bin packing problem
• New algorithmic results for bin packing and scheduling
• scientific article; zbMATH DE number 6767525 (Why is no real title available?)
• Minimum Weighted Sum Bin Packing
• Several methods of analysis for cardinality constrained bin packing
• Several methods of analysis for cardinality constrained bin packing
• Improved approximation algorithms for bin packing with conflicts
• Min-sum bin packing
• Bin packing with rejection revisited

This page was built for publication: Batched bin packing revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2398649)