Approximation of a batch consolidation problem

DOI10.1002/NET.20409MaRDI QIDQ3113503zbMATH OpenOpenAlexFDO

Authors Junho Chang, Soo Y. Chang, Sung-Pil Hong, Yunhong Min, 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

zbMATH Keywords

approximation algorithmbatch productionminimization of batch number inapproximability

Mathematics Subject Classification ID

Production models (90B30) Approximation methods and heuristics in mathematical programming (90C59) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Approximation of the \(k\)-batch consolidation problem
• Order consolidation for batch processing
• Order consolidation for hierarchical product lines
• Approximation algorithms in batch processing
• Batched bin packing revisited

Cites work

• A review of planning and scheduling systems and methods for integrated steel production
• An approximation scheme for bin packing with conflicts
• Approximation algorithms for time constrained scheduling
• Approximation of the \(k\)-batch consolidation problem
• Complexity of approximating bounded variants of optimization problems
• On the hardness of approximating minimization problems
• Optimization, approximation, and complexity classes

Cited in

(3)

• Approximation of the \(k\)-batch consolidation problem
• Order consolidation for batch processing
• Order consolidation for hierarchical product lines

This page was built for publication: Approximation of a batch consolidation problem

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