Scheduling in a queuing system with impatience and setup costs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

Scheduling in a queuing system with impatience and setup costs

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, we are able to compute explicitly the optimal value of this threshold according to the parameters of problem.
Fichier principal
Vignette du fichier
MSOM2010_paper61.pdf (41.93 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00864151 , version 1 (20-09-2013)

Identifiers

  • HAL Id : hal-00864151 , version 1

Cite

Alain Jean-Marie, Emmanuel Hyon. Scheduling in a queuing system with impatience and setup costs. 2010 MSOM Annual Conference and the Special Interest Group Conferences, Yale T. Herer, Jun 2010, Haifa, Israel. ⟨hal-00864151⟩
290 View
129 Download

Share

Gmail Facebook Twitter LinkedIn More