Approximation of a batch consolidation problem
From MaRDI portal
Publication:3113503
DOI10.1002/net.20409zbMath1230.90081OpenAlexW4231169679MaRDI QIDQ3113503
Soo Y. Chang, Junho Chang, Yunhong Min, Sung-Pil Hong, Myoung-Ju Park
Publication date: 18 January 2012
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20409
Abstract computational complexity for mathematical programming problems (90C60) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)
Related Items
Order consolidation for hierarchical product lines ⋮ Approximation of the \(k\)-batch consolidation problem
Cites Work
- Approximation algorithms for time constrained scheduling
- Approximation of the \(k\)-batch consolidation problem
- Optimization, approximation, and complexity classes
- An approximation scheme for bin packing with conflicts
- Complexity of approximating bounded variants of optimization problems
- On the hardness of approximating minimization problems
- A review of planning and scheduling systems and methods for integrated steel production