Dynamic Bin Packing

DOI10.1137/0212014MaRDI QIDQ3657446zbMATH OpenOpenAlexFDO

Authors M. R. Garey, E. G. jun. Coffman, D. S. Johnson

Publication date 1983

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0212014

zbMATH Keywords

approximation algorithmsmemory managementperformance evaluationstorage allocationworst-case bounds

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Cited in

(32)

• Improved lower bounds for semi-online bin packing problems
• On dynamic bin packing: An improved lower bound and resource augmentation analysis
• Bin packing with divisible item sizes
• Packings in two dimensions: Asymptotic average-case analysis of algorithms
• Dynamic bin packing with unit fraction items revisited
• Heuristic methods and applications: A categorized survey
• Homogeneous grouping of non-prime steel products for online auctions: a case study
• Fully dynamic bin packing revisited
• NF-based algorithms for online bin packing with buffer and bounded item size
• The dynamic frequency assignment problem
• Dynamic bin packing of unit fractions items
• On-line bin packing with restricted repacking
• Models for video-on-demand scheduling with costs
• NF-based algorithms for online bin packing with buffer and item size limitation
• Partially dynamic bin packing can be solved within \(1 + \varepsilon\) in (amortized) polylogarithmic time
• Semi-on-line bin packing: a short overview and a new lower bound
• Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime
• On some packing problem related to dynamic storage allocation
• Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps
• Fully-dynamic bin packing with little repacking
• A service system with packing constraints: greedy randomized algorithm achieving sublinear in scale optimality gap
• Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning
• Fast approximation methods for online scheduling of outpatient procedure centers
• A robust AFPTAS for online bin packing with polynomial migration
• On data reduction for dynamic vector bin packing
• Dynamic multi-dimensional bin packing
• Worst-case analysis of heuristic approaches for the temporal bin packing problem with fire-ups
• Renting servers in the cloud: the case of equal duration jobs
• A fundamental restriction on fully dynamic maintenance of bin packing
• Integrated packing and routing: a model and its solutions
• A dynamic storage process
• Online unit clustering: Variations on a theme

This page was built for publication: Dynamic Bin Packing

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