Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-17T06:14:02.837Z Has data issue: false hasContentIssue false

The queue with impatience: construction of the stationary workload under FIFO

Published online by Cambridge University Press:  14 July 2016

Pascal Moyal*
Affiliation:
Université de Technologie de Compiègne
*
∗ Postal address: Laboratoire de Mathématiques Appliquées de Compiègne, Université de Technologie de Compiègne, Département Génie Informatique, Centre de Recherches de Royallieu, BP 20 529, 60 205 Compiegne Cedex, France. Email address: pascal.moyal@utc.fr
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Copyright
Copyright © Applied Probability Trust 2010