Nonpreemptive Priority Queue with Binomial Input

A. R. Rajeswari
Additional contact information
A. R. Rajeswari: University of Bombay, India

Operations Research, 1968, vol. 16, issue 2, 416-421

Abstract: In our queue model of nonpreemptive priority discipline, we assume that arrivals occur at discrete time points, follow binomial distribution, and have a discrete time service distribution. In the limit, it is shown that all the parameters of the resulting queue, with the above arrival and service pattern, agree with those derived already by various authors, except for different notations used for service and arrival rates. At the end of this paper, this discipline is compared with that of the “first-come-first-served” discipline and the effect of priorities on average waiting time is obtained.

Date: 1968
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.16.2.416 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:16:y:1968:i:2:p:416-421

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().