Workload and busy period for M/GI/1 with a general impatience mechanism
Please always quote using this URN: urn:nbn:de:0297-zib-14304
- The paper deals with the workload and busy period for the M/GI/1 system under FCFS discipline, where the customers may become impatient during their waiting for service with generally distributed maximal waiting times and also during their service with generally distributed maximal service times depending on the time waited for service. This general impatience mechanism, originally introduced by Kovalenko (1961) and considered by Daley (1965), too, covers the special cases of impatience on waiting times as well as impatience on sojourn times, for which Boxma et al. (2010), (2011) gave new results and outlined special cases recently. Our unified approach bases on the vector process of workload and busy time. Explicit representations for the LSTs of workload and busy period are given in case of phase-type distributed impatience.
Author: | Andreas Brandt, Manfred Brandt |
---|---|
Document Type: | ZIB-Report |
Tag: | busy period; impatient customers; waiting time dependent service; workload |
MSC-Classification: | 60-XX PROBABILITY THEORY AND STOCHASTIC PROCESSES (For additional applications, see 11Kxx, 62-XX, 90-XX, 91-XX, 92-XX, 93-XX, 94-XX) |
Date of first Publication: | 2011/11/22 |
Series (Serial Number): | ZIB-Report (11-43) |
ISSN: | 1438-0064 |
ZIB-Reportnumber: | 11-43 |
Published in: | Appeared in: Queueing Systems, vol. 75 no. 2-4 (2013), pp. 189-209 |
DOI: | https://doi.org/10.1007/s11134-013-9373-7 |
Licence (German): | Creative Commons - Namensnennung |