Computer solution of queueing models

Abstract

This paper explores a rapid, low-cost approach to the solution of queueing models. The mutually-exclusive state differential equations are derived with the aid of a Markov transition matrix and then solved on an analog computer. The computer solution is obtained in graphical form as a function of time on an x-y plotter. A detailed derivation and method of solu tion is given for a two-phase single-service model. The analog solution has the advantage of including the transient region, an area difficult to analyze by classical mathematical techniques.