Service and capacity allocation in M/G/c/c state-dependent queueing networks |
| |
| Affiliation: | 1. Department of Mechanical & Industrial Engineering, University of Massachusetts, Amherst, MA 01003, USA;2. Departamento de Estatı́stica, Universidade Federal de Minas Gerais, Belo Horizonte, MG 31270-901, Brazil;1. Key Laboratory of Complex Systems Modeling and Simulation, Hangzhou Dianzi University, China;2. Beijing Advanced Innovation Center for Imaging Technology, College of Information Engineering, Capital Normal University, China;3. Mobile and Internet Systems Laboratory, Wayne State University, USA;4. School of Information and Electronic Engineering, Zhejiang University of Science & Technology, China;1. School of Information Management and Engineering, Shanghai Key Lab. of Financial Info. Tech., Shanghai University of Finance and Economics, Shanghai 200433, People''s Republic of China;2. Institute of Fintech, Shanghai University of Finance and Economics, Shanghai 200433, People''s Republic of China;3. School of Information Engineering, Huzhou University, Zhejiang, 313000, People''s Republic of China;1. Laboratoire Interdisciplinaire Carnot de Bourgogne, UMR 6303 CNRS-Université de Bourgogne, 9 Avenue Alain Savary, BP 47870, 21078 Dijon Cedex, France;2. Fiber Optics Research Center, 11933 Moscow, Russia;3. Dipartimento di Ingegneria dell’Informazione, Università degli Studi di Brescia, and Istituto Nazionale d’Ottica, CNR, via Branze 38, 25123 Brescia, Italy |
| |
| Abstract: | The problem of service and capacity allocation in state-dependent M/G/c/c queueing networks is analyzed and algorithms are developed to compute the optimal allocation c. The model is applied to the modeling of pedestrian circulation systems and basic series, merge, and split topologies are examined. Also of interest are applications to problems of evacuation planning in buildings. Computational experiments assert the algorithm's speed, robustness, and effectiveness. The results obtained indicate that the pattern of the optimal capacity surprisingly repeats over different topologies and it is also heavily dependent upon the arrival rate. Additional computational simulation results are provided to show the accuracy of the approach in all configurations tested. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
