MAP/M/c Queue with Constant Impatient Time

References

• Asmussen S.Applied Probability and Queues (1987) (John Wiley & Sons, New York) Google Scholar
• Asmussen S., Koole G. Marked point processes as limits of Markovian arrival streams. J. Appl. Probab. (1993) 30:365–372Crossref, Google Scholar
• Baccelli F., Hebuterne G., Kylstra F. J. On queues with impatient customers. Performance'81 (1981) (North-Holland, Amsterdam, The Netherlands) 159–179Google Scholar
• Baccelli F., Boyer P., Hebuterne G. Single server queues with impatient customers. Adv. Appl. Probab. (1984) 16:887–905Crossref, Google Scholar
• Barrer D. Y. Queuing with impatient customers and ordered service. Oper. Res. (1957) 5:650–656Link, Google Scholar
• Brandt A., Brandt M. On the M(n)/M(n)/s queues with impatient calls. Performance Evaluation (1999a) 35:1–18Crossref, Google Scholar
• Brandt A., Brandt M. On a two-queue priority system with impatience and its application to a call center. Methodology Comput. Appl. Probab. (1999b) 1:191–210Crossref, Google Scholar
• Choi B. D., Kim B., Chung J. M/M/1 queue with impatient customers of higher priority. Queueing System (2001) 38:49–66Crossref, Google Scholar
• Daley D. J. General customer impatience in the queue GI/G/1. J. Appl. Probab. (1965) 2:186–205Crossref, Google Scholar
• Davis M. H. A. Piecewise-deterministic Markov Processes: A general class of nondiffusion stochastic models. J. R. Statist. Soc. B (1984) 46:353–388Google Scholar
• Ethier S. N., Kurtz T. G.Markov Processes: Characterization and Convergence (1986) (John Wiley and Sons, Inc., New York) Crossref, Google Scholar
• Finch P. D. Deterministic customer impatience in the queueing system GI/M/1. Biometrika (1960) 47(1, 2):45–52Crossref, Google Scholar
• Gnedenko B. V., Kovalenko I. N.Introduction to Queueing Theory (1968) (Israel Program for Scientific Translations, Jerusalem) Google Scholar
• Gohberg I., Lancaster P., Rodman L.Matrix Polynomials (1982) (Academic Press, New York) Google Scholar
• Jurkevic O. M. On the investigation of many-server queueing systems with bounded waiting time. Izv. Akad. Nauk SSSR Techniceskaja Kibernetika (Russian) (1970) 5:50–58Google Scholar
• Jurkevic O. M. On many-server systems with stochastic bounds for the waiting time. Izv. Akad. Nauk SSSR Techniceskaja Kibernetika (Russian) (1971) 4:39–46Google Scholar
• de Kok A. G., Tijms H. C. A queueing system with impatient customers. J. Appl. Probab. (1985a) 22:688–696Crossref, Google Scholar
• de Kok A. G., Tijms H. C. A two-moment approximation for a buffer design problem requiring a small rejection probability. Performance Evaluation (1985b) 5:77–84Crossref, Google Scholar
• König D., Schmidt V. Extended and conditional versions of the PASTA property. Adv. Appl. Probab. (1990) 22:510–512Crossref, Google Scholar
• Latouche G., Ramaswami V.Introduction to Matrix Analytic Methods in Stochastic Modeling (1999) (SIAM, Philadelphia, PA) ASA-SIAM Series on Statistics and Applied ProbabilityCrossref, Google Scholar
• Movaghar A. On queueing with customer impatience until the beginning of service. Queueing System (1998) 29:337–350Crossref, Google Scholar
• Neuts M. F.Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach (1981) (The Johns Hopkins University Press, Baltimore, MD) Google Scholar
• Neuts M. F.Structured Stochastic Matrices of M/G/1 Type and Their Applications (1989) (Marcel Dekker, New York) Google Scholar
• Stanford R. E. Reneging phenomena in single server queues. Math. Oper. Res. (1979) 4:162–178Link, Google Scholar
• Stanford R. E. On queues with impatience. Adv. Appl. Probab. (1990) 22:768–769Crossref, Google Scholar