Scheduling of multi-class multi-server queueing systems with abandonments

Kód výsledku v 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>

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

Scheduling of multi-class multi-server queueing systems with abandonments

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Scheduling of multi-class multi-server queueing systems with abandonments

Popis výsledku anglicky

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.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

50201 - Economic Theory

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2017

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Journal of Scheduling

ISSN

1094-6136

e-ISSN

—

Svazek periodika

20

Číslo periodika v rámci svazku

2

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

17

Strana od-do

129-145

Kód UT WoS článku

000398942600002

EID výsledku v databázi Scopus

2-s2.0-84946782237