IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v29y1983i11p1298-1308.html
   My bibliography  Save this article

A Numerical Method to Obtain the Equilibrium Results for the Multiple Finite Source Priority Queueing Model

Author

Listed:
  • M. Jeya Chandra

    (Pennsylvania State University)

  • Robert G. Sargent

    (Syracuse University)

Abstract

In this paper a numerical method is presented to obtain the equilibrium results of the multiple finite source queueing model having a single server using a nonpreemptive fixed priority service discipline and where each class of customers has a different exponential interarrival density function and arbitrary service time distribution function. This solution method uses the method of imbedded Markov Chain and the renewal reward theorem to find the proportion of time the server is busy with the customers of different classes. The equilibrium results are then related to these proportions using an extension of Little's formula.

Suggested Citation

  • M. Jeya Chandra & Robert G. Sargent, 1983. "A Numerical Method to Obtain the Equilibrium Results for the Multiple Finite Source Priority Queueing Model," Management Science, INFORMS, vol. 29(11), pages 1298-1308, November.
  • Handle: RePEc:inm:ormnsc:v:29:y:1983:i:11:p:1298-1308
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.29.11.1298
    Download Restriction: no

    Citations

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


    Cited by:

    1. Haque, Lani & Armstrong, Michael J., 2007. "A survey of the machine interference problem," European Journal of Operational Research, Elsevier, vol. 179(2), pages 469-482, June.
    2. Seyed M. R. Iravani & Vijayalakshmi Krishnamurthy, 2007. "Workforce Agility in Repair and Maintenance Environments," Manufacturing & Service Operations Management, INFORMS, vol. 9(2), pages 168-184, January.

    More about this item

    Keywords

    queues; finite source; algorithmic method;

    Statistics

    Access and download statistics

    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:ormnsc:v:29:y:1983:i:11:p:1298-1308. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc). General contact details of provider: http://edirc.repec.org/data/inforea.html .

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

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.