Article ID: | iaor19982475 |
Country: | Netherlands |
Volume: | 79 |
Issue: | 1 |
Start Page Number: | 231 |
End Page Number: | 269 |
Publication Date: | Mar 1998 |
Journal: | Annals of Operations Research |
Authors: | Kouvatsos Demetres D., Awan Irfan-Ullah |
Keywords: | queueing networks, GE/GE/1 queues |
A new product-form approximation, based on the method of entropy maximisation (MEM), is characterised for arbitrary closed queueing networks with multiple and distinct classes of jobs, Generalised Exponential (GE) service times, mixed service disciplines, complete buffer sharing and repetitive-service blocking with both fixed (RS-FD) and random destinations (RS-RD). The maximum entropy (ME) approximation implies decomposition of the network into individual multiple class GE/GE/1/