Artalejo Rodríguez, Jesús ManuelGómez-Corral, Antonio2023-06-202023-06-2019950895-717710.1016/0895-7177(95)00120-Qhttps://hdl.handle.net/20.500.14352/57429In this paper, information theoretic inference methodology for system modeling is applied to estimate the stationary distribution for the number of customers in single server queueing systems with service capacity utilized by a finite population. The customers demand i.i.d. service times. Three different models are considered. In Model I, a customer who finds the server busy can be queued, whereas in Models II and III, any customer finding the server busy upon arrival will make repeated attempts to enter service until he eventually finds the server free. Models II and III differ in the retrial policy. Numerical examples illustrate the accuracy of the proposed maximum entropy estimation when it is compared with the classical analysis.engjournal articlehttp://www.sciencedirect.com/science/article/pii/089571779500120Qhttp://www.sciencedirect.com/restricted access519.216Maximum entropy estimationQuasi-random inputQueueing theoryRepeated attemptsStable recursion algorithmsProcesos estocásticos1208.08 Procesos Estocásticos