Asymptotically Optimal Control of Make-to-Stock Systems

Published Online:https://doi.org/10.1287/moor.2021.0161

References

  • [1] Arapostathis A, Biswas A, Pang G (2015) Ergodic control of multi-class M/M/N+M queues in the Halfin-Whitt regime. Ann. Appl. Probability 25(6):3511–3570.CrossrefGoogle Scholar
  • [2] Ata B, Barjesteh N (2022) An approximate analysis of dynamic pricing, outsourcing, and scheduling for a multiclass make-to-stock queue in the heavy traffic regime. Oper. Res. Forthcoming.Google Scholar
  • [3] Billingsley P (1999) Convergence of Probability Measures, 2nd ed. Wiley Series in Probability and Statistics: Probability and Statistics (John Wiley & Sons, Hoboken, NJ).CrossrefGoogle Scholar
  • [4] Boyd S, Vandenberghe L (2004) Convex Optimization (Cambridge University Press, Cambridge, UK).CrossrefGoogle Scholar
  • [5] Bramson M (1998) State space collapse with application to heavy traffic limits for multiclass queueing networks. Queueing Systems 30(1–2):89–140.CrossrefGoogle Scholar
  • [6] Budhiraja A, Ghosh A, Lee C (2011) Ergodic rate control problem for single class queueing networks. SIAM J. Control Optim. 49(4):1570–1606.CrossrefGoogle Scholar
  • [7] Cao P, Yao D (2018) Optimal drift rate control and impulse control for a stochastic inventory/production system. SIAM J. Control Optim. 56(3):1856–1883.CrossrefGoogle Scholar
  • [8] Dai JG (1995) On positive harris recurrence of multiclass queueing networks: A unified approach via fluid limit models. Ann. Appl. Probability 5(1):49–77.CrossrefGoogle Scholar
  • [9] Dai JG, Dai W (1999) A heavy traffic limit theorem for a class of open queueing networks with finite buffers. Queueing Systems 32:5–40.CrossrefGoogle Scholar
  • [10] Dai JG, Meyn SP (1995) Stability and convergence of moments for multiclass queueing networks via fluid limit models. IEEE Trans. Automated Control 40(11):1889–1904.CrossrefGoogle Scholar
  • [11] Dai JG, Yao D (2013) Brownian inventory models with convex holding cost, part 1: Average-optimal controls. Stochastic Systems 3(2):442–499.LinkGoogle Scholar
  • [12] Ethier SN, Kurtz TG (1986) Markov Processes: Characterization and Convergence (Wiley, New York).CrossrefGoogle Scholar
  • [13] Feinberg EA, Kasyanov PO, Zadoianchuk NV (2014) Fatou’s lemma for weakly converging probabilities. Theory Probability Appl. 58(4):683–689.CrossrefGoogle Scholar
  • [14] Gamarnik D, Zeevi A (2006) Validity of heavy traffic steady-state approximations in generalized Jackson networks. Ann. Appl. Probability 16(1):56–90.CrossrefGoogle Scholar
  • [15] Gao X, Huang J, Zhang J (2023) Asymptotically optimal control of omnichannel service systems with pick-up guarantees. Oper. Res. Forthcoming.LinkGoogle Scholar
  • [16] Goldberg DA, Reiman MI, Wang Q (2021) A survey of recent progress in the asymptotic analysis of inventory systems. Production Oper. Management 30(6):718–1750.CrossrefGoogle Scholar
  • [17] Harrison JM (1988) Brownian models of queueing networks with heterogeneous customer populations. Stochastic Differential Systems, Stochastic Control Theory and Applications (Springer, Berlin), 147–186.CrossrefGoogle Scholar
  • [18] Harrison JM, Taksar MI (1983) Instantaneous control of Brownian motion. Math. Oper. Res. 8(3):439–453.LinkGoogle Scholar
  • [19] Huang J, Gurvich I (2018) Beyond heavy-traffic regimes: Universal bounds and controls for the single-server queue. Oper. Res. 66(4):1168–1188.LinkGoogle Scholar
  • [20] Jacod J, Shiryaev A (2013) Limit Theorems for Stochastic Processes (Springer, Berlin).Google Scholar
  • [21] Mandelbaum A, Stolyar AL (2004) Scheduling flexible servers with convex delay costs: Heavy-traffic optimality of the generalized cμ-rule. Oper. Res. 52(6):836–855.LinkGoogle Scholar
  • [22] Meyn S, Tweedie R (1993) Stability of markovian processes III: Foster-lyapunov criteria for continuous-time processes. Adv. Appl. Probability 25(3):518–548.CrossrefGoogle Scholar
  • [23] Meyn S, Tweedie RL (2009) Markov Chains and Stochastic Stability, 2nd ed. (Cambridge University Press, Cambridge, UK).CrossrefGoogle Scholar
  • [24] Pang G, Talreja R, Whitt W (2007) Martingale proofs of many-server heavy-traffic limits for Markovian queues. Probability Survey 4:193–267.CrossrefGoogle Scholar
  • [25] Plambeck EL, Ward AR (2006) Optimal control of a high-volume assemble-to-order system. Math. Oper. Res. 31(3):453–477.LinkGoogle Scholar
  • [26] Plambeck E, Kumar S, Harrison JM (2001) A multiclass queue in heavy traffic with throughput time constraints: Asymptotically optimal dynamic controls. Queueing Systems 39(1):23–54.CrossrefGoogle Scholar
  • [27] Prato GD (2006) An Introduction to Infinite-Dimensional Analysis (Springer, Berlin).CrossrefGoogle Scholar
  • [28] Protter P (2005) Stochastic Integration and Differential Equations, vol. 21 (Springer, Berlin).CrossrefGoogle Scholar
  • [29] Puterman ML (2014) Markov Decision Processes: Discrete Stochastic Dynamic Programming (John Wiley & Sons, Hoboken, NJ).Google Scholar
  • [30] Reiman MI, Wang Q (2015) Asymptotically optimal inventory control for assemble-to-order systems with identical lead times. Oper. Res. 63(3):716–732.LinkGoogle Scholar
  • [31] van Mieghem JA (1995) Dynamic scheduling with convex delay costs: The generalized cμ rule. Ann. Appl. Probability 5(3):809–833.CrossrefGoogle Scholar
  • [32] Ward AR, Kumar S (2008) Asymptotically optimal admission control of a queue with impatient customers. Math. Oper. Res. 33(1):167–202.LinkGoogle Scholar
  • [33] Wein LM (1992) Dynamic scheduling of a multiclass make-to-stock queue. Oper. Res. 40(4):724–735.LinkGoogle Scholar
  • [34] Whitt W (2002) Stochastic-Process Limits (Springer-Verlag, New York).CrossrefGoogle Scholar
  • [35] Xu Y, Chao X (2009) Dynamic pricing and inventory control for a production system with average profit criterion. Probability Engrg. Inform. Sci. 23(3):489–513.CrossrefGoogle Scholar
  • [36] Zheng Y, Zipkin PH (1990) A queueing model to analyze the value of centralized inventory information. Oper. Res. 38(2):296–307.LinkGoogle 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.