Abstract
The paper develops the steady-state solution of a finite space queueing system wherein each of the two non-serial servers is separately in series with two non-serial servers. It is assumed that the arriving units of the same type may demand a different number of service phases. Poisson arrivals and exponential service times are assumed at all the four channels of the system. Service of units is completed on a first-come, first-served basis at each channel. The steady-state solution for infinite queueing space is obtained as a special case of finite queueing space.

This publication has 3 references indexed in Scilit: