ANALYSIS OF THE CONTROL OF QUEUES WITH SHORTEST PROCESSING TIME SERVICE DISCIPLINE

抄録

We analyze two models of controlled M/G/1 queues with shortest processing time service discipline and removable server. The control policies considered here are the server vacation policy of Levy and Yechiali and the N-controle policy of Heyman. The Laplace-Stieltjes transform of the waiting time distributions, the mean cost rates and the optimal control policies are derived for these two models. Properties of level crossings of regenerative processes and delayed busy cycles are used in our analysis.