|
|||||
|
|
Waiting times of a finite-capacity multi-server model with non-preemptive priorities |
|
| Institution: | 1. School of Industrial Engineering, Iran University of Science and Technology, Tehran, Islamic Republic of Iran;2. School of Accounting, Information Systems and Supply Chain, RMIT University, Melbourne, Australia;1. Dalhousie University, Department of Industrial Engineering, 5269 Morris Street, Room 108, Halifax, NS, B3H 4R2, Canada;2. Nova Scotia Emergency Health Services, 239 Brownlow Avenue, Suite 300, Dartmouth, NS, B3B 2B2, Canada;3. Dalhousie University, Department of Emergency Medicine, Division of EMS, 1796 Summer Street, Halifax Infirmary, Suite 355, Halifax, NS, B3H 3A7, Canada |
| Abstract: | We consider a non-preemptive head of the line multi-server priority model with finite capacity. The arrival processes of the different priority classes are independent Poisson processes. The service times are exponentially distributed and identical for the different priority classes. The model is described by a homogeneous continuous-time Markov chain. For the two-class model we derive an explicit representation of its steady-state distribution. Applying matrix-analytic methods we calculate the Laplace-Stieltjes Transform of the actual waiting time of each priority class of a p-class system. |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ | |