Asymptotically Optimal Inventory Control for Assemble-to-Order Systems

Published Online:https://doi.org/10.1287/stsy.2022.0099

References

  • Agrawal N, Cohen MA (2001) Optimal material control in an assembly system with component commonality. Naval Res. Logist. 48:409–429.Google Scholar
  • Akçay Y, Xu SH (2004) Joint inventory replenishment and component allocation optimization in an assemble-to-order system. Management Sci. 50:99–116.LinkGoogle Scholar
  • Atan Z, Ahmadi T, Stegehuis C, De Kok T, Adan I (2017) Assemble-to-order systems: A review. Eur. J. Oper. Res. 261:866–879.Google Scholar
  • Atar R, Keslassy I, Mendelson G (2019) Replicate to the shortest queues. Queueing Systems 92(1):1–23.Google Scholar
  • Bell SL, Williams RJ (2001) Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy. Ann. Appl. Probability 11:608–649.Google Scholar
  • Bramson M (1998) State space collapse with application to heavy traffic limits for multiclass queueing networks. Queueing Systems 30:89–140.Google Scholar
  • Bu J, Gong X, Yao D (2020) Constant-order policies for lost-sales inventory models with random supply functions: Asymptotics and heuristic. Oper. Res. 68:1063–1073.LinkGoogle Scholar
  • DeValve L, Pekeč S, Wei Y (2020) A primal-dual approach to analyzing ATO systems. Management Sci. 66:5389–5407.LinkGoogle Scholar
  • Doğru MK, Reiman MI, Wang Q (2010) A stochastic programming based inventory policy for assemble-to-order systems with application to the W model. Oper. Res. 58:849–864.LinkGoogle 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:446–468.Google Scholar
  • Goldberg DA, Reiman MI, Wang Q (2021) A survey of recent progress in the asymptotic analysis of inventory systems. Prod. Oper. Manag. 30:1718–1750.Google Scholar
  • Goldberg DA, Katz-Rogozhnikov DA, Lu Y, Sharma M, Squillante MS (2016) Asymptotic optimality of constant-order policies for lost sales inventory models with large lead times. Math. Oper. Res. 41:898–913.LinkGoogle Scholar
  • Harrison J (1988) Brownian models of queueing networks with heterogeneous customer populations. Inst. Math. Its Appl. 10:147.Google Scholar
  • Harrison J (1996) The bigstep approach to flow management in stochastic processing networks. Stochastic Networks Theory Appl. 4:147–186.Google Scholar
  • Harrison J, López M (1999) Heavy traffic resource pooling in parallel-server systems. Queueing Systems 33:339–368.Google Scholar
  • Harrison J, Wein L (1990) Scheduling networks of queues: Heavy traffic analysis of a two-station closed network. Oper. Res. 38:1052–1064.LinkGoogle Scholar
  • Harrison JM, van Mieghem JA (1997) Dynamic control of Brownian networks: State space collapse and equivalent workload formulations. Ann. Appl. Probability 7:747–771.Google Scholar
  • Hausman W, Lee H, Zhang A (1998) Order response time reliability in a multi-item inventory system. Eur. J. Oper. Res. 109:646–659.Google Scholar
  • Huang K, de Kok T (2015) Optimal FCFS allocation rules for periodic-review assemble-to-order systems. Naval Res. Logist. 62:158–169.Google Scholar
  • Huh WT, Rusmevichientong P (2009) A nonparametric asymptotic analysis of inventory planning with censored demand. Math. Oper. Res. 34:103–123.LinkGoogle 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:404–420.LinkGoogle Scholar
  • Karlin S, Scarf H (1958) Inventory models of the Arrow-Harris-Marschak type with time lag. Stud. Math. Theory Inventory Production 1:155.Google Scholar
  • Lu Y, Song J-S (2005) Order-based cost optimization in assemble-to-order systems. Oper. Res. 53:151–169.LinkGoogle Scholar
  • Lu L, Song JS, Zhang H (2015) Optimal and asymptotically optimal policies for assemble-to-order N- and W-systems. Naval Res. Logist. 62:617–645.Google Scholar
  • Lu Y, Song J-S, Zhao Y (2010) No-holdback allocation rules for continuous-time assemble-to-order systems. Oper. Res. 58:691–705.LinkGoogle Scholar
  • Mangasarian OL, Shiau T-H (1987) Lipschitz continuity of solutions of linear inequalities, programs, and complementarity problems. SIAM J. Control Optim. 25:583–595.Google Scholar
  • Meyer CD (2000) Matrix Analysis and Applied Linear Algebra, vol. 71 (SIAM, Philadelphia).Google Scholar
  • Nadar E, Akan M, Scheller-Wolf A (2014) Optimal structural results for assemble-to-order generalized M-systems. Oper. Res. 62:571–579.LinkGoogle Scholar
  • Plambeck EL, Ward AR (2006) Optimal control of a high-volume assemble-to-order system. Math. Oper. Res. 31:453–477.LinkGoogle Scholar
  • Reiman MI (1984) Some diffusion approximations with state space collapse. Modelling and Performance Evaluation Methodology (Springer, Berlin), 207–240.Google Scholar
  • Reiman MI (2004) A new and simple policy for a continuous review lost-sales inventory model. Unpublished manuscript.Google Scholar
  • Reiman MI, Wang Q (2012) A stochastic program based lower bound for assemble-to-order inventory systems. Oper. Res. Lett. 40:89–95.Google Scholar
  • Reiman MI, Wang Q (2015) Asymptotically optimal inventory control for assemble-to-order systems with identical lead times. Oper. Res. 63:716–732.LinkGoogle Scholar
  • Reiman MI, Wan H, Wang Q (2016) On the use of independent base-stock policies in assemble-to-order inventory systems with nonidentical lead times. Oper. Res. Lett. 44:436–442.Google Scholar
  • Rosling K (1989) Optimal inventory policies for assembly systems under random demands. Oper. Res. 37:565–579.LinkGoogle Scholar
  • Schrijver A (1986) Theory of Linear and Integer Programming (John Wiley & Sons, Hoboken, NJ).Google Scholar
  • Shapiro A, Dentcheva D, Ruszczyński A (2009) Lectures on Stochastic Programming: Modeling and Theory (SIAM, Philadelphia).Google Scholar
  • Song J-S, Zipkin P (2003) Supply chain operations: Assemble-to-order systems. Handbook Oper. Res. Management Sci. 11:561–596.Google Scholar
  • Stolyar AL, Wang Q (2022) Exploiting random lead times for significant inventory cost savings. Oper Res. 70(4):2496–2516.Google Scholar
  • van Jaarsveld W, Scheller-Wolf A (2015) Optimization of industrial-scale assemble-to-order systems. INFORMS J. Comput. 27:544–560.LinkGoogle Scholar
  • Wei L, Jasin S, Xin L (2021) On a deterministic approximation of inventory systems with sequential service-level constraints. Oper. Res. 69:1057–1076.LinkGoogle 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:1556–1565.LinkGoogle Scholar
  • Zhang AX (1997) Demand fulfillment rates in an assembleto-order system with multiple products and dependent demands. Production Oper. Management 6:309–324.Google Scholar
  • Zipkin PH (2000) Foundations of Inventory Management (McGraw-Hill, New York).Google Scholar
  • Zipkin P (2016) Some specially structured assemble-to-order systems. Oper. Res. Lett. 44:136–142.Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.