A note on an open-end bin packing problem
From MaRDI portal
Publication:5946719
DOI10.1002/jos.75zbMath0980.90027OpenAlexW1997598240MaRDI QIDQ5946719
Gilbert H. Young, Moshe Dror, Joseph Y.-T. Leung
Publication date: 14 October 2001
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jos.75
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Complexity and performance of numerical algorithms (65Y20)
Related Items (17)
Batch scheduling of step deteriorating jobs ⋮ On various open-end bin packing game ⋮ The air-cargo consolidation problem with pivot weight: models and solution methods ⋮ A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation ⋮ Open-end bin packing: new and old analysis approaches ⋮ A note on a variant of the online open end bin packing problem ⋮ Parameterized on-line open-end bin packing ⋮ Online minimization of the maximum starting time: migration helps ⋮ Single machine scheduling with small operator-non-availability periods ⋮ Integrated production and delivery scheduling with disjoint windows ⋮ Asymptotic fully polynomial approximation schemes for variants of open-end bin packing ⋮ Hardness of lazy packing and covering ⋮ Starting time minimization for the maximum job variant ⋮ More on ordered open end bin packing ⋮ On lazy bin covering and packing problems ⋮ Minimizing machine assignment costs over \(\Delta\)-approximate solutions of the scheduling problem \(P||C_{\max}\) ⋮ Scheduling two agent task chains with a central selection mechanism
Cites Work
This page was built for publication: A note on an open-end bin packing problem
