Optimal control of queues: removable servers

Abstract

This paper is devoted to the determination of the optimal operating rule for the behaviour
of a removable server. Wefirst examine the case of an individual service process, in M/G/1
queues with N-policy, D-policy and T-policy respectively; certain special cases are also
examined such as the finite capacity case, the case of heterogeneous customers,... The
problems with batch service are then described and two related applications are considered in details: the control of a shuttle and of a clearing system.