The design of a system with two parallel queues and one-way overflow

This paper deals with the problem how to design a queueing system, where two independent Poisson arrival streams have to be served efficaciously. The system consists of two parallel multiserver queues with waiting-rooms in which one-way overlow is allowed for. First a concise analysis for both exact and approximative methods in the system with over low is given. Then we show that in a specific situation a conversational computer algorithm might be an efficient instrument in the design of such systems. Special attention is devoted to a particular step in the algorithm: the solution of an optimization problem. An enumeration algorithm, using the proposed approximations, is discussed. Eventually some conclusions are drawn.