Hybrid computer solution of queueing systems

Digital computers have been widely used for solving queueing problems. However, when the complexity of the problem increases the computational time and cost rise exponentially. A hybrid computer approach has been developed where the rise in cost caused by the complexity of the problem is negligible. The errors of the hybrid system were not cummulative and therefore it was capable of duplicating the solution of the digital computer within the accuracy of 2 %. The optimization af a n stage stochastic service system has been used as an example. The success of this method of solution has opened a whole new dimension toward the application of hybrid computations to queueing problems.