201. The queue with impatience: construction of the stationary workload under FIFO
- Author
-
Pascal Moyal and Université de Technologie de Compiègne (UTC)
- Subjects
Service (business) ,Statistics and Probability ,Queueing theory ,Mathematical optimization ,FIFO (computing and electronics) ,General Mathematics ,010102 general mathematics ,Stability (learning theory) ,Workload ,01 natural sciences ,010104 statistics & probability ,Probability theory ,[MATH]Mathematics [math] ,0101 mathematics ,Statistics, Probability and Uncertainty ,Queue ,Mathematical economics ,Mathematics ,Numerical stability - Abstract
In this paper we study the stability of queueing systems with impatient customers and a single server operating under a FIFO (first-in-first-out) discipline. We first give a sufficient condition for the existence of a stationary workload in the case of impatience until the beginning of service. We then provide a weaker condition of existence on an enriched probability space using the theory of Anantharam et al. (1997), (1999). The case of impatience until the end of service is also investigated.
- Published
- 2010