Scheduling of multi-class multi-server queueing systems with abandonments
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11640%2F17%3A00475644" target="_blank" >RIV/00216208:11640/17:00475644 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/s10951-015-0456-7" target="_blank" >http://dx.doi.org/10.1007/s10951-015-0456-7</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s10951-015-0456-7" target="_blank" >10.1007/s10951-015-0456-7</a>
Alternative languages
Result language
angličtina
Original language name
Scheduling of multi-class multi-server queueing systems with abandonments
Original language description
Many real-world situations involve queueing systems in which customers may abandon if service does not start sufficiently quickly. We study a comprehensive model of multi-class queue scheduling accounting for customer abandonment, with the objective of minimizing the total discounted or time-average sum of linear waiting costs, completion rewards, and abandonment penalties of customers in the system. We assume the service times and abandoning times are exponentially distributed. We solve analytically the case in which there is one server and there are one or two customers in the system and obtain an optimal policy. For the general case, we use the framework of restless bandits to analytically design a novel simple index rule with a natural interpretation. We show that the proposed rule achieves near-optimal or asymptotically optimal performance both in single- and multi-server cases, both in overload and underload regimes, and both in idling and non-idling systems.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
50201 - Economic Theory
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2017
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Journal of Scheduling
ISSN
1094-6136
e-ISSN
—
Volume of the periodical
20
Issue of the periodical within the volume
2
Country of publishing house
US - UNITED STATES
Number of pages
17
Pages from-to
129-145
UT code for WoS article
000398942600002
EID of the result in the Scopus database
2-s2.0-84946782237