A note on an open-end bin packing problem

DOI10.1002/JOS.75MaRDI QIDQ5946719zbMATH OpenOpenAlexFDO

Authors Joseph Y.-T. Leung, Moshe Dror, Gilbert H. Young

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

zbMATH Keywords

approximation algorithmsbin packingcomplexity

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 1934389
• The Ordered Open-End Bin-Packing Problem
• Parameterized on-line open-end bin packing
• scientific article; zbMATH DE number 1934401
• More on ordered open end bin packing

Cites work

• Fast algorithms for bin packing
• Improved bounds for harmonic-based bin packing algorithms
• On a dual version of the one-dimensional bin packing problem
• On the Asymptotic Worst Case Behavior of Harmonic Fit

Cited in

(25)

• Hardness of lazy packing and covering
• On lazy bin covering and packing problems
• Parameterized on-line open-end bin packing
• Starting time minimization for the maximum job variant
• More on ordered open end bin packing
• On various open-end bin packing game
• Open-end bin packing: new and old analysis approaches
• 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
• Single machine scheduling with small operator-non-availability periods
• A note on a variant of the online open end bin packing problem
• The air-cargo consolidation problem with pivot weight: models and solution methods
• An Optimization Algorithm for the Ordered Open-End Bin-Packing Problem
• The Ordered Open-End Bin-Packing Problem
• scientific article; zbMATH DE number 1934389 (Why is no real title available?)
• scientific article; zbMATH DE number 1934401 (Why is no real title available?)
• Optimal Packing Problems: From Knapsack Problem to Open Dimension Problem
• Online minimization of the maximum starting time: migration helps
• Cost-sharing mechanisms for the selfish maximum open-end bin packing problem
• On open-end bin packing games
• Generalized last open-end bin packing problem
• Batch scheduling of step deteriorating jobs
• A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation
• Integrated production and delivery scheduling with disjoint windows
• Asymptotic fully polynomial approximation schemes for variants of open-end bin packing

This page was built for publication: A note on an open-end bin packing problem

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