Switching on and off the full capacity of an M/M/∞ queue

摘要

This paper studies optimal switching on and off the full capacity of an M/M/∞ queue with holding, running and switching costs. The main result is that an average-cost optimal policy either always runs the system or is defined by two thresholds M and N, such that the system is switched on at arrival epochs when the number of customers in the system accumulates to N and it is switched off at departured epoch when the number of customers in the system decreases to M.