Article ID: | iaor19982472 |
Country: | Netherlands |
Volume: | 79 |
Issue: | 1 |
Start Page Number: | 143 |
End Page Number: | 180 |
Publication Date: | Mar 1998 |
Journal: | Annals of Operations Research |
Authors: | Kouvatsos Demetres D., Skianis Charalabos A. |
Keywords: | production: FMS |
A cost-effective decomposition algorithm is proposed for the approximate analysis of arbitrary first-come-first-served open queueing network models (QNMs) with Generalised Exponential (GE) external interarrival time and service time distributions, multiple vacation periods, exhaustive service scheme and repetitive service blocking of random destination. The algorithm is based on new product-form approximation suggested by the information theoretic principle of Minimum Relative Entropy, subject to marginal mean value constraints and a prior joint distribution estimate of the corresponding open QNM with infinite capacity. The censored GE/GE/1/