Artalejo Rodríguez, Jesús ManuelEconomou, Antonis2023-06-202023-06-202005-091387-584110.1007/s11009-005-4522-zhttps://hdl.handle.net/20.500.14352/50012The authors thank the referee for the constructive suggestions on the earlier version of this paper. Jesus Artalejo thanks the support received from the research project BFM2002-02189. Antonis Economou was supported by the University of Athens grant ELKE/70/4/6415 and by the European Union and the Greek Ministry of Education program PYTHAGORAS/2004.We study Markovian queueing systems in which the service rate varies whenever the queue length changes. More specifically we consider controllable queues operating under the so-called hysteretic policy which provides a rather versatile class of operating rules for increasing and decreasing service rate at the arrival and service completion times. The objective of this paper is to investigate algorithmically the busy period and the waiting time distributions. Our analysis supplements the classical work of Yadin and Naor (1967) who focused on the steady-state probabilities of the system state.engjournal articlehttp://www.springerlink.com/content/783v32630657w174/fulltext.pdf?MUD=MPhttp://www.springerlink.comrestricted access519.8QueueingHysteretic PolicyBusy PeriodWaiting TimeRemovable ServersInvestigación operativa (Matemáticas)1207 Investigación Operativa