Priority Queues with Setup Times

Hideaki Takagi
Additional contact information
Hideaki Takagi: IBM Tokyo Research Laboratory, Tokyo, Japan

Operations Research, 1990, vol. 38, issue 4, 667-677

Abstract: Queueing analysis is conducted for M/G/1-type systems with multiple classes of service requests that need a setup time prior to each busy period. We consider a variety of service disciplines: FCFS (first-come, first-served), LCFS (last-come, first-served), nonpreemptive priority, preemptive resume priority, and gated batch priority. This study has been motivated by the performance evaluation of multiprocessor bus arbitration protocols. The Laplace–Stieltjes transform of the distribution function, the mean, and the second moment of the waiting time for each class are derived explicitly. As a limit of continuous priorities, the shortest-job-first discipline with setup times is also considered.

Keywords: queues; priority: priority queues with setup times (search for similar items in EconPapers)
Date: 1990
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.38.4.667 (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:38:y:1990:i:4:p:667-677

Access Statistics for this article

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