Transient solutions for some exhaustive M/G/1 queues with generalized independent vacations (Q1105924)

``With vacations'' means that the servers can be unavailable for occasional intervals of time. Three such models are studied: single vacation; repeated vacation: if the server finds the system empty at the end of a vacation, he will immediately take another vacation; N-policy model: the server waits until there are exactly N customers waiting before serving again. The author recalls some personal results [see Math. Oper. Res. 5, 147-159 (1980; Zbl 0428.60097) and Adv. Appl. Probab. 12, 501-516 (1980; Zbl 0425.60085)] about a so-called ``exceptional'' M/G/1 queueing model in which the customer who initiates a busy period has to wait for a certain independent random period. Then he relates this model to queues with generalized vacations, comparing his results (e.g. about expected waiting times) with existing ones [\textit{Y. Levy} and \textit{U. Yechiali}, Management Sci. 22, 201-211 (1975; Zbl 0313.60067)].