Preemptive Repeat Priority Queues as a Special Case of the Multipurpose Server Problem---II

B. Avi-Itzhak
Additional contact information
B. Avi-Itzhak: Technion-lsrael Institute of Technology, Haifa, Israel

Operations Research, 1963, vol. 11, issue 4, 610-619

Abstract: In this part of the study it is assumed that the servicing rate of the station is constant and the variability of service time is caused by the differing service requirements of the customers. Some characteristics of the model, such as the expected queue length and queuing time are derived. The effect of the type of service time variability upon the expected queue length is illustrated by a numerical example. The preemptive repeat priority problem, analogous to this model, is solved as a special case. Some other special cases are discussed in the paper.

Date: 1963
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.11.4.610 (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:11:y:1963:i:4:p:610-619

Access Statistics for this article

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