A Primal-Dual Approach to Analyzing ATO Systems

References

• Agrawal S, Wang Z, Ye Y (2014) A dynamic near-optimal algorithm for online linear programming. Oper. Res. 62(4):876–890.Link, Google Scholar
• Baker KR, Magazine MJ, Nuttle HLW (1986) The effect of commonality on safety stock in a simple inventory model. Management Sci. 32(8):982–988.Link, Google Scholar
• Bernstein F, DeCroix GA, Wang Y (2011) The impact of demand aggregation through delayed component allocation in an assemble-to-order system. Management Sci. 57(6):1154–1171.Link, Google Scholar
• Birge JR, Louveaux F (2011) Introduction to Stochastic Programming (Springer Science & Business Media, New York).Crossref, Google Scholar
• DeCroix GA, Song J-S, Zipkin PH (2009) Managing an assemble-to-order system with returns. Manufacturing Service Oper. Management 11(1):144–159.Link, Google Scholar
• Doğru MK, Reiman MI, Wang Qiong (2010) A stochastic programming based inventory policy for assemble-to-order systems with application to the W model. Oper. Res. 58(4, part 1):849–864.Google Scholar
• Doğru MK, Reiman MI, Wang Q (2017) Assemble-to-order inventory management via stochastic programming: Chained BOMs and the M-system. Production Oper. Management 26(3):446–468.Crossref, Google Scholar
• Dye S, Stougie L, Tomasgard A (2003) The stochastic single resource service-provision problem. Naval Res. Logist. 50(8):869–887.Crossref, Google Scholar
• Feige U (1998) A threshold of ln(n) for approximating set cover. J. ACM 45(4):634–652.Crossref, Google Scholar
• Gerchak Y, Magazine MJ, Gamble AB (1988) Component commonality with service level requirements. Management Sci. 34(6):753–760.Link, Google Scholar
• Glasserman P, Wang Y (1998) Leadtime-inventory trade-offs in assemble-to-order systems. Oper. Res. 46(6):858–871.Link, Google Scholar
• Gupta A, Ravi R, Sinha A (2007) LP rounding approximation algorithms for stochastic network design. Math. Oper. Res. 32(2):345–364.Link, Google Scholar
• Halman N, Orlin JB, Simchi-Levi D (2012) Approximating the nonlinear newsvendor and single-item stochastic lot-sizing problems when data are given by an oracle. Oper. Res. 60(2):429–446.Link, Google Scholar
• Huh WT, Janakiraman G, Muckstadt JA, Rusmevichientong P (2009) Asymptotic optimality of order-up-to policies in lost sales inventory systems. Management Sci. 55(3):404–420.Link, Google Scholar
• Jain K, Vazirani VV (2001) Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation. J. ACM 48(2):274–296.Crossref, Google Scholar
• Kapuscinski R, Zhang RQ, Carbonneau P, Moore R, Reeves B (2004) Inventory decisions in Dell’s supply chain. Interfaces 34(3):191–205.Link, Google Scholar
• Kleywegt AJ, Shapiro A, Homem-de Mello T (2002) The sample average approximation method for stochastic discrete optimization. SIAM J. Optim. 12(2):479–502.Crossref, Google Scholar
• Kolliopoulos SG (2003) Approximating covering integer programs with multiplicity constraints. Discrete Appl. Math. 129(2–3):461–473.Crossref, Google Scholar
• Kolliopoulos SG, Young NE (2001) Tight approximation results for general covering integer programs. Proc. 42nd IEEE Sympos. Foundations Comput. Sci. (IEEE, New York), 522–528.Google Scholar
• Levi R, Pál M, Roundy RO, Shmoys DB (2007) Approximation algorithms for stochastic inventory control models. Math. Oper. Res. 32(2):284–302.Link, Google Scholar
• Levi R, Roundy R, Shmoys D, Sviridenko M (2008) A constant approximation algorithm for the one-warehouse multiretailer problem. Management Sci. 54(4):763–776.Link, Google Scholar
• Levi R, Roundy RO, Shmoys DB (2006) Primal-dual algorithms for deterministic inventory problems. Math. Oper. Res. 31(2):267–284.Link, Google Scholar
• Lu L, Song J-S, Zhang H (2015) Optimal and asymptotically optimal policies for assemble-to-order N- and W-systems. Naval Res. Logist. 62(8):617–645.Crossref, Google Scholar
• Lu Y, Song J-S (2005) Order-based cost optimization in assemble-to-order systems. Oper. Res. 53(1):151–169.Link, Google Scholar
• Lu Y, Song J-S, Yao DD (2005) Backorder minimization in multiproduct assemble-to-order systems. IIE Trans. 37(8):763–774.Crossref, Google Scholar
• Lu Y, Song J-S, Zhao Y (2010) No-holdback allocation rules for continuous-time assemble-to-order systems. Oper. Res. 58(3):691–705.Link, Google Scholar
• Muller J (2010) BMW’s push for made-to-order cars. Forbes (September 9), https://www.forbes.com/forbes/2010/0927/companies-bmw-general-motors-cars-bespoke-auto.html.Google Scholar
• Nadar E, Akan M, Scheller-Wolf A (2014) Optimal structural results for assemble-to-order generalized M-systems. Oper. Res. 62(3):571–579.Link, Google Scholar
• Nagarajan M, Bassok Y (2008) A bargaining framework in supply chains: The assembly problem. Management Sci. 54(8):1482–1496.Link, Google Scholar
• Nagarajan M, Sošić G (2009) Coalition stability in assembly models. Oper. Res. 57(1):131–145.Link, Google Scholar
• Nagarajan V, Shi C (2016) Approximation algorithms for inventory problems with submodular or routing costs. Math. Programming 160(1–2):225–244.Crossref, Google Scholar
• Nemirovski A, Juditsky A, Lan G, Shapiro A (2009) Robust stochastic approximation approach to stochastic programming. SIAM J. Optim. 19(4):1574–1609.Crossref, Google Scholar
• Plambeck EL, Ward AR (2006) Optimal control of a high-volume assemble-to-order system. Math. Oper. Res. 31(3):453–477.Link, Google Scholar
• Plambeck EL, Ward AR (2007) Note: A separation principle for a class of assemble-to-order systems with expediting. Oper. Res. 55(3):603–609.Link, Google Scholar
• Ravi R, Sinha A (2006) Hedging uncertainty: Approximation algorithms for stochastic optimization problems. Math. Programming 108(1):97–114.Crossref, Google Scholar
• Reiman MI, Wan H, Wang Q (2018) Asymptotically optimal inventory control for assemble-to-order systems. Preprint, submitted 21, https://arxiv.org/abs/1809.08271.Google Scholar
• Reiman MI, Wang Q (2015) Asymptotically optimal inventory control for assemble-to-order systems with identical lead times. Oper. Res. 63(3):716–732.Link, Google Scholar
• Schulz AS, Skutella M (2002) Scheduling unrelated machines by randomized rounding. SIAM J. Discrete Math. 15(4):450–469.Crossref, Google Scholar
• Shapiro A, Dentcheva D, Ruszczyński A (2009) Lectures on Stochastic Programming: Modeling and Theory (Society for Industrial and Applied Mathematics, Philadelphia).Crossref, Google Scholar
• Shmoys DB, Swamy C (2006) An approximation scheme for stochastic linear programming and its application to stochastic integer programs. J. ACM 53(6):978–1012.Crossref, Google Scholar
• Shmoys DB, Tardos É, Aardal K (1997) Approximation algorithms for facility location problems. Proc 29th Annual ACM Sympos. Theory Comput (Association for Computing Machinery, New York), 265–274.Google Scholar
• Song J-S (2002) Order-based backorders and their implications in multi-item inventory systems. Management Sci. 48(4):499–516.Link, Google Scholar
• Song J-S, Zhao Y (2009) The value of component commonality in a dynamic inventory system with lead times. Manufacturing Service Oper. Management 11(3):493–508.Link, Google Scholar
• Song J-S, Zipkin P (2003) Supply chain operations: Assemble-to-order systems. Supply Chain Management: Design, Coordination and Operation, Handbooks in Operations Research and Management Science, vol. 11 (Elsevier, Amsterdam), 561–596.Google Scholar
• Teo C-P, Bertsimas D (2001) Multistage lot sizing problems via randomized rounding. Oper. Res. 49(4):599–608.Link, Google Scholar
• van Jaarsveld W, Scheller-Wolf A (2015) Optimization of industrial-scale assemble-to-order systems. INFORMS J. Comput. 27(3):544–560.Link, Google Scholar
• Vazirani VV (2013) Approximation Algorithms (Springer Science & Business Media, New York).Google Scholar
• Williamson DP, Goemans MX, Mihail M, Vazirani VV (1995) A primal-dual approximation algorithm for generalized Steiner network problems. Combinatorica 15(3):435–454.Crossref, Google Scholar
• Xin L, Goldberg DA (2016) Optimality gap of constant-order policies decays exponentially in the lead time for lost sales models. Oper. Res. 64(6):1556–1565.Link, Google Scholar
• Xu PJ, Allgor R, Graves SC (2009) Benefits of reevaluating real-time order fulfillment decisions. Manufacturing Service Oper. Management 11(2):340–355.Link, Google Scholar
• Zipkin P (2016) Some specially structured assemble-to-order systems. Oper. Res. Lett. 44(1):136–142.Crossref, Google Scholar