Abstract
The problem is to determine an explicit form for the stationary distribution of an imbedded Markov Chain in aGI/M/S queue with balking and reneging.
We first construct the discrete transforms — introduced bySubba Rao/Jaiswal [1969] — for this queueing system. Then, using this concept, we resolve the problem, obtaining a new way for determining the transition probabilities of the imbedded Markov chain.
Zusammenfassung
Thema dieses Aufsatzes ist die Bestimmung der stationären Verteilung einer eingebetteten Markov-Kette in einemGI/M/S Wartesystem mit ungeduldigen Kunden. Anhand der vonSubba Rao/Jaiswal [1969] eingeführten diskreten Transformation gelingt es, die Übergangswahrscheinlichkeiten der eingebetteten Markov-Kette explizit zu bestimmen.
Similar content being viewed by others
References
Finch, P.D.: Balking in the queuing systemGI/M/1. Acta Math. Acad. Sci. Hungr.10, 1959, 240–247.
Subba Rao, S., andN.K. Jaiswal: Queueing with balking and reneging inM/G/1 Systems. ORSA17 (6), 1969, 1062–1976.
Teghem, J., Jr.: Properties of (0,k) policies in aM/G/1 queue and optimal joining rules in aM/M/1 queue with removable server. Operational Research '75. Ed. by K.B. Haley, Amsterdam 1976.
Yechiali, U.: On optimal balking rules and toll charges in theGI/M/1 Queueing process. ORSA19 (2), 1971, 349–370.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Teghem, J. Use of discrete transforms for the study of aGI/M/S queue with impatient customer phenomena. Zeitschrift für Operations Research 23, 95–106 (1979). https://doi.org/10.1007/BF01951544
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF01951544