On Two Priority Multi-Server Queues with Impatient Customers
This study considers a system of multi-server queues with two classes of impatient customers: high-priority and low-priority. Customers join the system according to a Poisson process and customers may abandon service after entering the queue for an exponentially distributed duration with distinct...
Main Author: | |
---|---|
Format: | Article |
Language: | English |
Published: |
Operations research society of Taiwan
2016-07-01
|
Series: | International Journal of Operations Research |
Subjects: | |
Online Access: | http://www.orstw.org.tw/ijor/vol13no2/IJOR2016_vol13_no2_p058_p076_final.pdf |
id |
doaj-36e6d28abf4247b6a4363774a57ff3ea |
---|---|
record_format |
Article |
spelling |
doaj-36e6d28abf4247b6a4363774a57ff3ea2020-11-24T20:41:40ZengOperations research society of TaiwanInternational Journal of Operations Research1813-713X1813-71482016-07-011325876On Two Priority Multi-Server Queues with Impatient CustomersHung-Wei Li0Department of Mathematical Sciences, National Chengchi University, Taipei, TaiwanThis study considers a system of multi-server queues with two classes of impatient customers: high-priority and low-priority. Customers join the system according to a Poisson process and customers may abandon service after entering the queue for an exponentially distributed duration with distinct rates. In this paper, we consider last come-first served (LCFS) and first come-first served (FCFS), and service time is assumed to be distributed exponentially among all customers. Deriving the Laplace transforms of the defined random variables and applying the matrix geometric method with direct truncation makes it possible to obtain an approximation of the stationary distribution in order to calculate the expected waiting time for both classes of customers. For each class of customer, we derive performance measures related to stationary probability distributions and conditional waiting times.http://www.orstw.org.tw/ijor/vol13no2/IJOR2016_vol13_no2_p058_p076_final.pdfmulti-server queuesimpatient customersnon-preemptive service policy |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Hung-Wei Li |
spellingShingle |
Hung-Wei Li On Two Priority Multi-Server Queues with Impatient Customers International Journal of Operations Research multi-server queues impatient customers non-preemptive service policy |
author_facet |
Hung-Wei Li |
author_sort |
Hung-Wei Li |
title |
On Two Priority Multi-Server Queues with Impatient Customers |
title_short |
On Two Priority Multi-Server Queues with Impatient Customers |
title_full |
On Two Priority Multi-Server Queues with Impatient Customers |
title_fullStr |
On Two Priority Multi-Server Queues with Impatient Customers |
title_full_unstemmed |
On Two Priority Multi-Server Queues with Impatient Customers |
title_sort |
on two priority multi-server queues with impatient customers |
publisher |
Operations research society of Taiwan |
series |
International Journal of Operations Research |
issn |
1813-713X 1813-7148 |
publishDate |
2016-07-01 |
description |
This study considers a system of multi-server queues with two classes of impatient customers: high-priority
and low-priority. Customers join the system according to a Poisson process and customers may abandon service after
entering the queue for an exponentially distributed duration with distinct rates. In this paper, we consider last come-first
served (LCFS) and first come-first served (FCFS), and service time is assumed to be distributed exponentially among all
customers. Deriving the Laplace transforms of the defined random variables and applying the matrix geometric method
with direct truncation makes it possible to obtain an approximation of the stationary distribution in order to calculate the
expected waiting time for both classes of customers. For each class of customer, we derive performance measures related to
stationary probability distributions and conditional waiting times. |
topic |
multi-server queues impatient customers non-preemptive service policy |
url |
http://www.orstw.org.tw/ijor/vol13no2/IJOR2016_vol13_no2_p058_p076_final.pdf |
work_keys_str_mv |
AT hungweili ontwoprioritymultiserverqueueswithimpatientcustomers |
_version_ |
1716824261381849088 |