Get access

Analysis of the finite-source multiclass priority queue with an unreliable server and setup time

Authors

  • Pedram Sahba,

    1. Department of Mechanical and Industrial Engineering, University of Toronto, 5 King's College Road, Toronto, Ontario M5S 3G8, Canada
    Search for more papers by this author
  • Bariş Balciog̃lu,

    Corresponding author
    1. Faculty of Engineering and Natural Sciences, Sabancı University, Orhanlı-Tuzla, 34956 Istanbul, Turkey
    • Faculty of Engineering and Natural Sciences, Sabancı University, Orhanlı-Tuzla, 34956 Istanbul, Turkey
    Search for more papers by this author
  • Dragan Banjevic

    1. Department of Mechanical and Industrial Engineering, University of Toronto, 5 King's College Road, Toronto, Ontario M5S 3G8, Canada
    Search for more papers by this author

Abstract

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

Get access to the full text of this article

Ancillary