Artalejo Rodríguez, Jesús ManuelChakravarthy, S. R.2023-06-202023-06-202006-121134-576410.1007/BF02837565https://hdl.handle.net/20.500.14352/49987The authors thank an anonymous referee for his/her constructive comments on an earlier version of the paper. The first author thanks the support received from the research project MTM2005-01248. This research was conducted while the second author was visiting the Complutense University of Madrid, Madrid, Spain, and would like to thank the hospitality of the Department of Statistics and Operations Research.In this paper the distribution of the maximum number of customers in a retrial orbit for a single server queue with Markovian arrival process and phase type services is studied. Efficient algorithm for computing the probability distribution and some interesting numerical examples are presented.engjournal articlehttp://www.springerlink.com/content/123m77uth8050q11/fulltext.pdfhttp://www.springerlink.com/restricted access519.8Markovian arrival processretrialbusy periodqueueingmaximal queue lengthphase type distributionand algorithmic probabilityInvestigación operativa (Matemáticas)1207 Investigación Operativa