We consider two parallel M/M/1 queues. The serve, at one of the queues is s
ubject to intermittent breakdowns. By the theory of dynamic programming, we
determine a threshold optimal policy which consists to transfer; when it i
s necessary, the customers that arrive at the first queue towards the secon
d queue in order to minimize an instantaneous cost depending of the two que
ue lengths.