摘要

A system with several queues is considered. Each queue has a server with exponential service time with same service rate. Normal customers arrive at the system and choose which queue to join. They are supposed to join the shortest queue. Special customers also arrive at the system though the arrivals are rare. They can also choose which queue to join and they have other options, waiting in the room for them and leaving the system. This paper deals with the optimal policy of the special customers. It is shown that the optimal policy has monotone properties.

  • 出版日期2011-3