Matrix‐geometric solution of discrete time MAP/PH/1 priority queue

Attahiru Sule Alfa

Naval Research Logistics (NRL), 1998, vol. 45, issue 1, 23-50

Abstract: We use the matrix‐geometric method to study the discrete time MAP/PH/1 priority queue with two types of jobs. Both preemptive and non‐preemptive cases are considered. We show that the structure of the R matrix obtained by Miller for the Birth‐Death system can be extended to our Quasi‐Birth‐Death case. For both preemptive and non‐preemptive cases the distributions of the number of jobs of each type in the system are obtained and their waiting times are obtained for the non‐preemptive. For the preemptive case we obtain the waiting time distribution for the high priority job and the distribution of the lower priority job's wait before it becomes the leading job of its priority class. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 23–50, 1998

Date: 1998
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://doi.org/10.1002/(SICI)1520-6750(199802)45:13.0.CO;2-N

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:wly:navres:v:45:y:1998:i:1:p:23-50

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().