Premium
Analysis of the finite‐source multiclass priority queue with an unreliable server and setup time
Author(s) -
Sahba Pedram,
Balciog̃lu Bariş,
Banjevic Dragan
Publication year - 2013
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/nav.21537
Subject(s) - computer science , queue , queueing theory , service (business) , class (philosophy) , duration (music) , process (computing) , operations research , population , queueing system , real time computing , mathematical optimization , computer network , mathematics , operating system , artificial intelligence , art , demography , economy , literature , sociology , economics
In this article, we study a queueing system serving multiple classes of customers. Each class has a finite‐calling population. The customers are served according to the preemptive‐resume priority policy. We assume general distributions for the service times. For each priority class, we derive the steady‐state system size distributions at departure/arrival and arbitrary time epochs. We introduce the residual augmented process completion times conditioned on the number of customers in the system to obtain the system time distribution. We then extend the model by assuming that the server is subject to operation‐independent failures upon which a repair process with random duration starts immediately. We also demonstrate how setup times, which may be required before resuming interrupted service or picking up a new customer, can be incorporated in the model. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013