A Primal-Dual Approach to Analyzing ATO Systems

We study assemble-to-order (ATO) problems from the literature. ATO problems with general structure and integrality constraints are well known to be difficult to solve, and we provide new insight into these issues by establishing worst-case approximation guarantees through primal-dual analyses and linear programming (LP) rounding. First, we relax the one-period ATO problem using a natural newsvendor decomposition and use the dual solution for the relaxation to derive a lower bound on optimal cost, providing a tight approximation guarantee that grows with the maximum product size in the system. Then, we present an LP rounding algorithm that achieves both asymptotic optimality as demand grows large, and a 1.8 approximation factor for any problem instance. In addition to theoretical guarantees, we perform comprehensive numerical simulations and find that our rounding algorithm outperforms existing techniques and is close to optimal. Finally, we demonstrate that our one-period LP rounding results can be used to develop an asymptotically optimal integral policy for dynamic ATO problems with backlogging and identical component lead-times. This paper was accepted by Yinyu Ye, optimization.

• 저널Management Science · 66(11) · 5389–5407
• 토픽Supply Chain and Inventory Management · Management Information Systems
• DOI10.1287/mnsc.2019.3486
• 저자Levi DeValve, Yehua Wei