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

The QNET Method for Re-Entrant Queueing Networks with Priority Disciplines

Author

Listed:
  • J. G. Dai

    (Georgia Institute of Technology, Atlanta, Georgia)

  • D. H. Yeh

    (Kao Shiung Institute of Technology, Taiwan)

  • C. Zhou

    (Georgia Institute of Technology, Atlanta, Georgia)

Abstract

This paper is concerned with the estimation of performance measures of two priority disciplines in a d -station re-entrant queueing network. Such networks arise from complex manufacturing systems such as wafer fabrication facilities. The priority disciplines considered are First-Buffer-First-Served (FBFS) and Last-Buffer-First-Served (LBFS). An analytical method is developed to estimate the long-run average workload at each station and the mean sojourn time in the network. When the first-buffer-first-served discipline is used, a refined estimate of the mean sojourn time is also developed. The workload estimation has two steps. In the first step, following Harrison and Williams (Harrison, J. M., R. J. Williams. 1992. Brownian models of feedforward queueing networks: Quasireversibility and product form solutions. Anns. Appl. Prob. 2 263–293.), we use a d -dimensional reflecting Brownian motion (RBM) to model the workload process. We prove that the RBM exists and is unique in distribution and that it has a unique stationary distribution. We then use an algorithm of Dai and Harrison (Dai, J. G., J. M. Harrison. 1992. Reflected Brownian motion in an orthant: Numerical methods for steady-state analysis. Anns. Appl. Prob. 2 65–86.) to compute the stationary distribution of the RBM. Our method uses both the first and second moment information, and it is rooted in heavy traffic theory. It is closely related to the QNET method of Harrison and Nguyen (Harrison, J. M., V. Nguyen. 1993. Brownian models of multiclass queueing networks: Current status and open problems. Queueing Systems: Theory and Appl. 13 5–40.) for two-moment analysis of First-In-First-Out (FIFO) discipline. Our performance estimates of several example problems are compared to the simulation estimates to illustrate the effectiveness of our method.

Suggested Citation

  • 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.
    • Handle: RePEc:inm:oropre:v:45:y:1997:i:4:p:610-623
    DOI: 10.1287/opre.45.4.610
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.45.4.610
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.45.4.610?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
    ---><---

    Citations

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


    Cited by:

    1. 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.
    2. 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.

    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:45:y:1997:i:4:p:610-623. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.