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

Brownian Approximations of Multiclass Open-Queueing Networks

Author

Listed:
  • Hong Chen

    (Faculty of Commerce and Business Administration, University of British Columbia, Vancouver, British Columbia, Canada, V6T 1Z2)

  • Xinyang Shen

    (Faculty of Commerce and Business Administration, University of British Columbia, Vancouver, British Columbia, Canada, V6T 1Z2)

  • David D. Yao

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

Abstract

We study a multiclass open-queueing network with a set of single-server stations that operate under a combination of FIFO (first-in-first out) and priority service disciplines, and are subject to random breakdowns. Assuming that the primitive processes---in particular, external arrivals, service requirements, service capacities (up and down times), and the routing mechanism---follow two-moment approximations (based on functional central limit theorems), we develop a semi-martingale reflected Brownian motion (SRBM) approximation for the performance processes such as workload, queue lengths, and sojourn times. We illustrate through numerical examples in comparison against simulation that the SRBM approximation, while not always supported by a limit theorem, exhibits good accuracy in most cases. Through analyzing special networks, we also discuss the existence of the SRBM approximation in relation to the stability and the heavy traffic limits of the networks.

Suggested Citation

  • Hong Chen & Xinyang Shen & David D. Yao, 2002. "Brownian Approximations of Multiclass Open-Queueing Networks," Operations Research, INFORMS, vol. 50(6), pages 1032-1049, December.
    • Handle: RePEc:inm:oropre:v:50:y:2002:i:6:p:1032-1049
    DOI: 10.1287/opre.50.6.1032.349
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.50.6.1032.349
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.50.6.1032.349?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. J. Michael Harrison & Lawrence M. Wein, 1990. "Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Closed Network," Operations Research, INFORMS, vol. 38(6), pages 1052-1064, December.
    2. J. Michael Harrison & Michael T. Pich, 1996. "Two-Moment Analysis of Open Queueing Networks with General Workstation Capabilities," Operations Research, INFORMS, vol. 44(6), pages 936-950, December.
    3. J. G. Dai & D. H. Yeh & C. Zhou, 1997. "The QNET Method for Re-Entrant Queueing Networks with Priority Disciplines," Operations Research, INFORMS, vol. 45(4), pages 610-623, August.
    4. Martin I. Reiman, 1984. "Open Queueing Networks in Heavy Traffic," Mathematics of Operations Research, INFORMS, vol. 9(3), pages 441-458, August.
    5. Gabriel R. Bitran & Devanath Tirupati, 1988. "Multiproduct Queueing Networks with Deterministic Routing: Decomposition Approach and the Notion of Interference," Management Science, INFORMS, vol. 34(1), pages 75-100, January.
    6. Lawrence M. Wein, 1990. "Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Network with Controllable Inputs," Operations Research, INFORMS, vol. 38(6), pages 1065-1078, December.
    7. William P. Peterson, 1991. "A Heavy Traffic Limit Theorem for Networks of Queues with Multiple Customer Types," Mathematics of Operations Research, INFORMS, vol. 16(1), pages 90-118, February.
    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. Przemysław Korytkowski & Tomasz Wiśniewski, 2011. "Performance analysis of commercial offset printing under dynamic priority rules," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 21(1), pages 53-64.

    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. Ick-Hyun Nam, 2001. "Dynamic Scheduling for a Flexible Processing Network," Operations Research, INFORMS, vol. 49(2), pages 305-315, April.
    2. Subba Rao, S. & Gunasekaran, A. & Goyal, S. K. & Martikainen, T., 1998. "Waiting line model applications in manufacturing," International Journal of Production Economics, Elsevier, vol. 54(1), pages 1-28, January.
    3. Bertsimas, Dimitris & Paschalidis, Ioannis Ch. & Tsitsiklis, John N., 1992. "Optimization of multiclass queuing networks : polyhedral and nonlinear characterizations of achievable performance," Working papers 3509-92., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    4. Santiago R. Balseiro & David B. Brown & Chen Chen, 2021. "Dynamic Pricing of Relocating Resources in Large Networks," Management Science, INFORMS, vol. 67(7), pages 4075-4094, July.
    5. 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.
    6. Gregory Dobson & Tolga Tezcan & Vera Tilson, 2013. "Optimal Workflow Decisions for Investigators in Systems with Interruptions," Management Science, INFORMS, vol. 59(5), pages 1125-1141, May.
    7. Martin I. Reiman & Lawrence M. Wein, 1998. "Dynamic Scheduling of a Two-Class Queue with Setups," Operations Research, INFORMS, vol. 46(4), pages 532-547, August.
    8. Wendell G. Gilland, 2001. "Effective Sequencing Rules for Closed Manufacturing Networks," Operations Research, INFORMS, vol. 49(5), pages 759-770, October.
    9. Melanie Rubino & Barış Ata, 2009. "Dynamic Control of a Make-to-Order, Parallel-Server System with Cancellations," Operations Research, INFORMS, vol. 57(1), pages 94-108, February.
    10. Suresh Chand & Ting Zeng, 2001. "A Comparison of U-Line and Straight-Line Performances Under Stochastic Task Times," Manufacturing & Service Operations Management, INFORMS, vol. 3(2), pages 138-150, January.
    11. Amy R. Ward & Sunil Kumar, 2008. "Asymptotically Optimal Admission Control of a Queue with Impatient Customers," Mathematics of Operations Research, INFORMS, vol. 33(1), pages 167-202, February.
    12. Narahari, Y. & Khan, L. M., 1998. "Asymptotic loss of priority scheduling policies in closed re-entrant lines: A computational study," European Journal of Operational Research, Elsevier, vol. 110(3), pages 585-596, November.
    13. Martin I. Reiman & Lawrence M. Wein, 1999. "Heavy Traffic Analysis of Polling Systems in Tandem," Operations Research, INFORMS, vol. 47(4), pages 524-534, August.
    14. Erica L. Plambeck, 2008. "Asymptotically Optimal Control for an Assemble-to-Order System with Capacitated Component Production and Fixed Transport Costs," Operations Research, INFORMS, vol. 56(5), pages 1158-1171, October.
    15. Lee, Heeseok, 1995. "Assignment of a job load in a distributed system: A multicriteria design method," European Journal of Operational Research, Elsevier, vol. 87(2), pages 274-283, December.
    16. Shaler Stidham, 2002. "Analysis, Design, and Control of Queueing Systems," Operations Research, INFORMS, vol. 50(1), pages 197-216, February.
    17. Paul Glasserman & Yashan Wang, 1999. "Fill-Rate Bottlenecks in Production-Inventory Networks," Manufacturing & Service Operations Management, INFORMS, vol. 1(1), pages 62-76.
    18. van Ackere, Ann, 1996. "The management of congestion," European Journal of Operational Research, Elsevier, vol. 89(2), pages 223-225, March.
    19. Dieter Armbruster & Daniel E. Marthaler & Christian Ringhofer & Karl Kempf & Tae-Chang Jo, 2006. "A Continuum Model for a Re-entrant Factory," Operations Research, INFORMS, vol. 54(5), pages 933-950, October.
    20. Barış Ata, 2006. "Dynamic Control of a Multiclass Queue with Thin Arrival Streams," Operations Research, INFORMS, vol. 54(5), pages 876-892, October.

    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:50:y:2002:i:6:p:1032-1049. 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.