Throughput bounding and simple approximation methods for exponential fork join queueing networks with blocking

Exponential fork/join queueing networks (FJQNs) with finite buffers have be en used as a major tool for evaluating the performances of manufacturing sy stems. In this study, we first suggest the throughput upper and lower bound s. Our upper-bounding method is elaborated on with general network configur ation (acyclic configuration), while our lower bounds can be obtained only for networks with more specialized configuration. Next developed is a simpl e approximation method for throughputs, which are based on decomposition/ag gregation principles and structurally equivalent relations between differen t configurations. (C) 1998 Elsevier Science Ltd. All rights reserved.