On the Optimal Order of Stations in Tandem Queues

Consider m nonidentical service stations which have to be set up in a sequence j1, J2,..., jm. At time t = 0 the system is empty and there is an infinite number of customers waiting in front of station j1. Customers have to be served first at station j1, after finishing service there they have to go through station j2, etc. Both the cases of infinite waiting room and of zero waiting room between the stations are considered; in the case of zero waiting room, blocking may occur. We study how the output process depends on the sequence in which the stations are set up.