A Numerical Method to Obtain the Equilibrium Results for the Multiple Finite Source Priority Queueing Model
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.
Volume (Year): 29 (1983)
Issue (Month): 11 (November)
|Contact details of provider:|| Postal: |
Web page: http://www.informs.org/
More information through EDIRC
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)
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 references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link 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 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.