M/G/1 Queues with Scheduling within Generations and Removable Server

Two models of M/G/1 queues with removable server and scheduling within generations are considered in this paper. The scheduling policy considered here is the shortest processing time; the control policies are the multiple vacations policy and N-control policy. The Laplace-Stieltjes transforms of the waiting time distribution, the mean cost rates and the optimal control policies are derived for these two models. Properties of the delayed busy cycle are used in our analysis.