A Note on a Queueing Optimization Problem

Abstract

Van Ackere and Ninios (VN) used discrete-event simulation to determine the optimal strategies for a monopolist who operates a single-server facility and uses advertising to attract customers. Their model was based upon an M/E_r/1/K queue. In this paper, we re-analyze their model using queueing theory and numerical optimization. Our results allow the optimal strategies to be characterized more precisely, and this leads to a reassessment and modification of the conclusions reached by VN.

Keywords:

• Optimization
• Queueing
• Simulation