A batch arrival MX / M / c queue with impatient customers

Bara Kim; Jeongsim Kim

doi:10.1016/j.orl.2014.02.001

A batch arrival ^MX / M / c queue with impatient customers

Bara Kim, Jeongsim Kim

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

8 Citations (Scopus)

Abstract

This paper considers a multi-server batch arrival ^MX/M/c queue with impatient customers. We give an exact expression for the loss probability, which can be expressed in terms of the waiting time distribution in the standard ^MX/M/c queue with no impatience. This solves the problem conjectured by Boots and Tijms (1999).

Original language	English
Pages (from-to)	180-185
Number of pages	6
Journal	Operations Research Letters
Volume	42
Issue number	2
DOIs	https://doi.org/10.1016/j.orl.2014.02.001
Publication status	Published - 2014 Mar

Keywords

/ M / c queue
Impatient customers
Loss probability

ASJC Scopus subject areas

Software
Management Science and Operations Research
Industrial and Manufacturing Engineering
Applied Mathematics

Access to Document

10.1016/j.orl.2014.02.001

Cite this

@article{c43cbe55e3ca43399bb7c9ddb72bd0c3,

title = "A batch arrival MX / M / c queue with impatient customers",

abstract = "This paper considers a multi-server batch arrival MX/M/c queue with impatient customers. We give an exact expression for the loss probability, which can be expressed in terms of the waiting time distribution in the standard MX/M/c queue with no impatience. This solves the problem conjectured by Boots and Tijms (1999).",

keywords = "/ M / c queue, Impatient customers, Loss probability",

author = "Bara Kim and Jeongsim Kim",

note = "Funding Information: We deeply appreciate professor Henk Tijms for letting us know a long-standing conjecture. B. Kim{\textquoteright}s research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Science, ICT & Future Planning (MSIP) ( 2011-0025576 ). J. Kim{\textquoteright}s research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education, Science and Technology ( NRF-2011-0011887 ). ",

year = "2014",

month = mar,

doi = "10.1016/j.orl.2014.02.001",

language = "English",

volume = "42",

pages = "180--185",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier",

number = "2",

}

TY - JOUR

T1 - A batch arrival MX / M / c queue with impatient customers

AU - Kim, Bara

AU - Kim, Jeongsim

N1 - Funding Information: We deeply appreciate professor Henk Tijms for letting us know a long-standing conjecture. B. Kim’s research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Science, ICT & Future Planning (MSIP) ( 2011-0025576 ). J. Kim’s research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education, Science and Technology ( NRF-2011-0011887 ).

PY - 2014/3

Y1 - 2014/3

N2 - This paper considers a multi-server batch arrival MX/M/c queue with impatient customers. We give an exact expression for the loss probability, which can be expressed in terms of the waiting time distribution in the standard MX/M/c queue with no impatience. This solves the problem conjectured by Boots and Tijms (1999).

AB - This paper considers a multi-server batch arrival MX/M/c queue with impatient customers. We give an exact expression for the loss probability, which can be expressed in terms of the waiting time distribution in the standard MX/M/c queue with no impatience. This solves the problem conjectured by Boots and Tijms (1999).

KW - / M / c queue

KW - Impatient customers

KW - Loss probability

UR - http://www.scopus.com/inward/record.url?scp=84894704027&partnerID=8YFLogxK

U2 - 10.1016/j.orl.2014.02.001

DO - 10.1016/j.orl.2014.02.001

M3 - Article

AN - SCOPUS:84894704027

VL - 42

SP - 180

EP - 185

JO - Operations Research Letters

JF - Operations Research Letters

SN - 0167-6377

IS - 2

ER -