Article contents
Weak convergence in an appointment system
Published online by Cambridge University Press: 14 July 2016
Abstract
It is assumed that customers at a service facility have appointments at times 0,1,2, … for which they may be unpunctual by random amounts or may never arrive at all. A weak convergence theorem is proved for the process which counts the number of arrivals. This makes it possible to carry over the results of Iglehart and Whitt (1970a) to obtain heavy traffic functional limit theorems for queues with arrivals by appointment.
Keywords
- Type
- Short Communications
- Information
- Copyright
- Copyright © Applied Probability Trust 1975
References
- 2
- Cited by