We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
PRIORITY QUEUES WITH SETUP TIMES.
- Authors
Takagi, Hideaki
- 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.
- Subjects
QUEUING theory; DISCIPLINE; STIELTJES transform; STOCHASTIC processes; DISTRIBUTION (Probability theory); PRODUCTION scheduling; PROBABILITY theory
- Publication
Operations Research, 1990, Vol 38, Issue 4, p667
- ISSN
0030-364X
- Publication type
Article
- DOI
10.1287/opre.38.4.667