Approximation of multiclass queuing networks with highly variable arrivals under deterministic routing

Approximation of multiclass queuing networks with highly variable arrivals under deterministic routing

0.00 Avg rating0 Votes
Article ID: iaor20063690
Country: United States
Volume: 52
Issue: 5
Start Page Number: 399
End Page Number: 408
Publication Date: Aug 2005
Journal: Naval Research Logistics
Authors:
Keywords: queueing networks
Abstract:

In this paper, we present the heavy-traffic bottleneck phenomenon under multiclass deterministic routing and discuss how it can be addressed by decomposition approximation. Examples show that Bitran and Tirupati's method and Whitt's enhancements for deterministic routing may not properly account for this phenomenon. We propose refinements to these methods based on Whitt's variability functions. Results of numerical experiments on simple networks and semiconductor manufacturing process show significant improvement in the approximation of expected waiting time at bottleneck stations.

Reviews

Required fields are marked *. Your email address will not be published.