Abstract
This paper deals with open queueing networks with group arrivals in continuous time and discrete time. By using the method of entropy maximization, an equivalent single customer arrival process is obtained and the results are then applied to study a variety of queueing systems. As extensions to queueing networks, the following cases are investigated: single-server nodes in continuous time and discrete time, multiple exponential-server nodes in continuous time, and single exponential-server nodes with finite capacity in continuous time. Several examples are included for illustration.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Wu, JS. Maximum Entropy Analysis of Open Queueing Networks with Group Arrivals. J Oper Res Soc 43, 1063–1078 (1992). https://doi.org/10.1057/jors.1992.164
Published:
Issue Date:
DOI: https://doi.org/10.1057/jors.1992.164