Dynamic Bin Packing
From MaRDI portal
Publication:3657446
DOI10.1137/0212014zbMath0512.68050OpenAlexW1975216035MaRDI QIDQ3657446
Michael R. Garey, David S. Johnson, Edward G. jun. Coffman
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
Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)
Related Items
Models for video-on-demand scheduling with costs, 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, The dynamic frequency assignment problem, Dynamic bin packing of unit fractions items, Bin packing with divisible item sizes, Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime, Homogeneous grouping of non-prime steel products for online auctions: a case study, 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, Dynamic bin packing with unit fraction items revisited, Dynamic multi-dimensional bin packing, On data reduction for dynamic vector bin packing, On-line bin packing with restricted repacking, Fast Approximation Methods for Online Scheduling of Outpatient Procedure Centers, Fully-Dynamic Bin Packing with Little Repacking, A fundamental restriction on fully dynamic maintenance of bin packing, Online unit clustering: Variations on a theme, On some packing problem related to dynamic storage allocation, Packings in two dimensions: Asymptotic average-case analysis of algorithms, Fully dynamic bin packing revisited, Improved lower bounds for semi-online bin packing problems, On dynamic bin packing: An improved lower bound and resource augmentation analysis, A dynamic storage process, Heuristic methods and applications: A categorized survey, A Robust AFPTAS for Online Bin Packing with Polynomial Migration, Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps, 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
