A note on an open-end bin packing problem
From MaRDI portal
Publication:5946719
DOI10.1002/jos.75zbMath0980.90027MaRDI QIDQ5946719
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
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
65Y20: Complexity and performance of numerical algorithms
Related Items
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, Hardness of lazy packing and covering, On lazy bin covering and packing problems, Parameterized on-line open-end bin packing
Cites Work