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.
No takes yet. Share an insight, caveat, or question.
Shanthikumar et al. (1981) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: