Scheduling in a queuing system with impatience and setup costs

Alain Jean-Marie 1, 2, * Emmanuel Hyon 3
* Corresponding author
1 MAESTRO - Models for the performance analysis and the control of networks
CRISAM - Inria Sophia Antipolis - Méditerranée
2 APR - Algorithmes et Performance des Réseaux
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : We consider a single server queue in discrete time, in which customers must be served before some limit sojourn time of geometrical distribution. A customer who is not served before this limit leaves the system: it is impatient. The fact of serving customers and the fact of losing them due to impatience induce costs. The purpose is to decide when to serve the customers so as to minimize costs. We use a Markov Decision Process with infinite horizon and discounted cost. We establish the structural properties of the stochastic dynamic programming operator, and we deduce that the optimal policy is of threshold type. In addition, thanks to a pathwise comparison analysis of two threshold policies, we are able to compute explicitly the optimal value of this threshold according to the parameters of problem.
Complete list of metadatas

Cited literature [17 references]  Display  Hide  Download

https://hal.inria.fr/inria-00369382
Contributor : Alain Jean-Marie <>
Submitted on : Monday, February 8, 2010 - 5:43:14 PM
Last modification on : Thursday, March 21, 2019 - 2:17:31 PM
Long-term archiving on : Wednesday, November 30, 2016 - 1:04:33 PM

File

RR-6881_v2.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00369382, version 2

Citation

Alain Jean-Marie, Emmanuel Hyon. Scheduling in a queuing system with impatience and setup costs. [Research Report] RR-6881, INRIA. 2009. ⟨inria-00369382v2⟩

Share

Metrics

Record views

586

Files downloads

203