IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v65y2017i1p221-241.html
   My bibliography  Save this article

Optimal Resource Capacity Management for Stochastic Networks

Author

Listed:
  • A. B. Dieker

    (Industrial Engineering and Operations Research, Columbia University, New York, New York 10027)

  • S. Ghosh

    (Mathematical Sciences Department, IBM Research, Yorktown Heights, New York 10598)

  • M. S. Squillante

    (Mathematical Sciences Department, IBM Research, Yorktown Heights, New York 10598)

Abstract

We develop a framework for determining the optimal resource capacity of each station composing a stochastic network, motivated by applications arising in computer capacity planning and business process management. The problem is mathematically intractable in general and therefore one typically resorts to either simplistic analytical approximations or time-consuming simulation-based optimization methods. Our solution framework includes an iterative methodology that relies only on the capability of observing the queue lengths at all network stations for a given resource capacity allocation. We theoretically investigate this proposed methodology for single-class Brownian tree networks and illustrate the use of our framework and the quality of its results through computational experiments.

Suggested Citation

  • A. B. Dieker & S. Ghosh & M. S. Squillante, 2017. "Optimal Resource Capacity Management for Stochastic Networks," Operations Research, INFORMS, vol. 65(1), pages 221-241, February.
    • Handle: RePEc:inm:oropre:v:65:y:2017:i:1:p:221-241
    DOI: 10.1287/opre.2016.1554
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.2016.1554
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.2016.1554?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. P.K. Pollett, 2009. "Optimal capacity assignment in general queueing networks," Springer Optimization and Its Applications, in: Charles Pearce & Emma Hunt (ed.), Optimization, edition 1, chapter 0, pages 261-272, Springer.
    2. Pierre L'Ecuyer & Peter W. Glynn, 1994. "Stochastic Optimization by Simulation: Convergence Proofs for the GI/G/1 Queue in Steady-State," Management Science, INFORMS, vol. 40(11), pages 1562-1578, November.
    3. Joseph Abate & Ward Whitt, 2006. "A Unified Framework for Numerically Inverting Laplace Transforms," INFORMS Journal on Computing, INFORMS, vol. 18(4), pages 408-421, November.
    4. Le An & Pham Tao, 2005. "The DC (Difference of Convex Functions) Programming and DCA Revisited with DC Models of Real World Nonconvex Optimization Problems," Annals of Operations Research, Springer, vol. 133(1), pages 23-46, January.
    5. Boxma, O. J. & Rinnooy Kan, A. H. G. & van Vliet, M., 1990. "Machine allocation problems in manufacturing networks," European Journal of Operational Research, Elsevier, vol. 45(1), pages 47-54, March.
    6. Martin I. Reiman, 1984. "Open Queueing Networks in Heavy Traffic," Mathematics of Operations Research, INFORMS, vol. 9(3), pages 441-458, August.
    7. K. Dębicki & A. B. Dieker & T. Rolski, 2007. "Quasi-Product Forms for Lévy-Driven Fluid Networks," Mathematics of Operations Research, INFORMS, vol. 32(3), pages 629-647, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Janusz SZPYTKO & Yorlandys SALGADO DUARTE, 2021. "Robust Simulation Method Of Complex Technical Transport Systems," Transport Problems, Silesian University of Technology, Faculty of Transport, vol. 16(2), pages 101-112, June.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. A. B. Dieker & S. Ghosh & M. S. Squillante, 2017. "Optimal Resource Capacity Management for Stochastic Networks," Operations Research, INFORMS, vol. 65(1), pages 221-241, February.
    2. Bitran, Gabriel R. & Morabito, Reinaldo., 1994. "Open queueing networks : optimization and performance evaluation models for discrete manufacturing systems," Working papers 3743-94., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    3. Josh Reed & Yair Shaki, 2015. "A Fair Policy for the G / GI / N Queue with Multiple Server Pools," Mathematics of Operations Research, INFORMS, vol. 40(3), pages 558-595, March.
    4. Saulius Minkevičius & Igor Katin & Joana Katina & Irina Vinogradova-Zinkevič, 2021. "On Little’s Formula in Multiphase Queues," Mathematics, MDPI, vol. 9(18), pages 1-15, September.
    5. Laura Girometti & Martin Huska & Alessandro Lanza & Serena Morigi, 2024. "Convex Predictor–Nonconvex Corrector Optimization Strategy with Application to Signal Decomposition," Journal of Optimization Theory and Applications, Springer, vol. 202(3), pages 1286-1325, September.
    6. J. X. Cruz Neto & P. R. Oliveira & A. Soubeyran & J. C. O. Souza, 2020. "A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem," Annals of Operations Research, Springer, vol. 289(2), pages 313-339, June.
    7. David Landriault & Bin Li & Hongzhong Zhang, 2014. "On the Frequency of Drawdowns for Brownian Motion Processes," Papers 1403.1183, arXiv.org.
    8. Leippold, Markus & Vasiljević, Nikola, 2017. "Pricing and disentanglement of American puts in the hyper-exponential jump-diffusion model," Journal of Banking & Finance, Elsevier, vol. 77(C), pages 78-94.
    9. M. Bierlaire & M. Thémans & N. Zufferey, 2010. "A Heuristic for Nonlinear Global Optimization," INFORMS Journal on Computing, INFORMS, vol. 22(1), pages 59-70, February.
    10. Runhuan Feng & Hans W. Volkmer, 2015. "Conditional Asian Options," Papers 1505.06946, arXiv.org.
    11. Bai, Jushan & Liao, Yuan, 2016. "Efficient estimation of approximate factor models via penalized maximum likelihood," Journal of Econometrics, Elsevier, vol. 191(1), pages 1-18.
    12. Mor Harchol-Balter, 2021. "Open problems in queueing theory inspired by datacenter computing," Queueing Systems: Theory and Applications, Springer, vol. 97(1), pages 3-37, February.
    13. William Haskell & J. Shanthikumar & Z. Shen, 2013. "Optimization with a class of multivariate integral stochastic order constraints," Annals of Operations Research, Springer, vol. 206(1), pages 147-162, July.
    14. Markus Leippold & Nikola Vasiljević, 2020. "Option-Implied Intrahorizon Value at Risk," Management Science, INFORMS, vol. 66(1), pages 397-414, January.
    15. Jean-Paul Penot, 2011. "The directional subdifferential of the difference of two convex functions," Journal of Global Optimization, Springer, vol. 49(3), pages 505-519, March.
    16. Sumit Kunnumkal & Huseyin Topaloglu, 2009. "A stochastic approximation method for the single-leg revenue management problem with discrete demand distributions," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 70(3), pages 477-504, December.
    17. Landriault, David & Shi, Tianxiang, 2015. "Occupation times in the MAP risk model," Insurance: Mathematics and Economics, Elsevier, vol. 60(C), pages 75-82.
    18. Mor Armony & Constantinos Maglaras, 2004. "On Customer Contact Centers with a Call-Back Option: Customer Decisions, Routing Rules, and System Design," Operations Research, INFORMS, vol. 52(2), pages 271-292, April.
    19. Saulius Minkevičius & Edvinas Greičius, 2019. "Heavy Traffic Limits for the Extreme Waiting Time in Multi-phase Queueing Systems," Methodology and Computing in Applied Probability, Springer, vol. 21(1), pages 109-124, March.
    20. Bretthauer, Kurt M. & Cote, Murray J., 1997. "Nonlinear programming for multiperiod capacity planning in a manufacturing system," European Journal of Operational Research, Elsevier, vol. 96(1), pages 167-179, January.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:65:y:2017:i:1:p:221-241. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.