Key points are not available for this paper at this time.
An open queueing network model of dynamic job shops with general service times and first come first served or shortest processing time service discipline is considered here. An approximate decomposition approach is proposed to analyse this queueing network model and its accuracy is compared to simulation results of some symmetric and flow shops.
Shanthikumar et al. (1981) studied this question.