Premium
Approximation of multiclass queueing networks with highly variable arrivals under deterministic routing
Author(s) -
Kim Sunkyo
Publication year - 2005
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/nav.20085
Subject(s) - bottleneck , queueing theory , computer science , routing (electronic design automation) , mathematical optimization , simple (philosophy) , variable (mathematics) , decomposition , mathematics , computer network , mathematical analysis , philosophy , ecology , epistemology , biology , embedded system
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. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.