On the Dynamic Control of Matching Queues

References

• Ata, B. and Kumar, S., Heavy traffic analysis of open processing networks with complete resource pooling: Asymptotic optimality of discrete review policies. Ann. Appl. Prob., 2005. MR2115046Google Scholar
• Bell, S. L. and Williams, R. J., Dynamic scheduling of a parallel server system in heavy traffic with complete resource pooling: Asymptotic optimality of a threshold policy. Electronic Journal of Probability, 10(33):1044–1115, 2005. MR2164040Google Scholar
• Doğru, M. K., Reiman, M. I., and Wang, Q., A stochastic programming based inventory policy for assemble-to-order systems with application to the W model. Operations Research, 58(4):849–864, 2010. MR2683480Link, Google Scholar
• Harrison, J. M., Assembly-like queues. Journal of Appl. Prob., 10:354–367, 1973. MR0356276Google Scholar
• Harrison, J. M., The BIGSTEP approach to flow management in stochastic processing networks. In F. Kelly, S. Zachary, and I. Ziedins, editors, Stochastic Networks: Theory and Applications, pages 57–90. Oxford University Press, 1996.Google Scholar
• Harrison, J. M., Correction: Brownian models of open processing networks: Canonical representation of workload. Ann. Appl. Prob., 16(3):1703–1732, 2006. MR2260079Google Scholar
• Harrison, J. M. and Lopez, M. J., Heavy traffic resource pooling in parallel-server systems. Queueing Systems, 33:339–368, 1999. MR1742575Google Scholar
• Harrison, J. M. and Van Mieghem, J. A., Dynamic control of brownian networks: State space collapse and equivalent workload formulations. Ann. Appl. Prob., 7:747–771, 1996. MR1459269Google Scholar
• Horvath, L., Strong approximation of renewal processes. Stochastic Processes and Their Applications, 18(1):127–138, 1984. MR0757352Google Scholar
• Kang, W. N., Kelly, F. P., Lee, N. H., and Williams, R. J., State space collapse and diffusion approximation for a network operating under a fair bandwidth sharing policy. Ann. Appl. Prob., 19(5):1719–1780, 2009. MR2569806Google Scholar
• Mandelbaum, A. and Stolyar, S., Scheduling flexible servers with convex delay costs: Heavy-traffic optimality of the generalized cμ-rule. Operations Research, 52:836–855, 2004. MR2104141Link, Google Scholar
• Plambeck, E. L. and Ward, A. R., Optimal control of a high-volume assemble-to-order system. Mathematics of Operations Research, 31(3):453–477, 2006. MR2254418Link, Google Scholar
• Reiman, M. I. and Wang, Q., Asymptotically optimal inventory control for assemble-to-order systems with identical lead times, 2013. Working Paper.Google Scholar
• Revuz, D. and Yor, M., Continuous Martingales and Brownian Motion, volume 293. Springer Verlag, 1999. MR1725357Google Scholar
• Song, J. S. and Zipkin, P., Supply chain operations: Assemble-to-order and configure-to-order systems. In Handbooks in Operations Research and Management Science, volume XXX, pages 561–593, 2003.Google Scholar