Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks
Authors:
- Reinaldo MorabitoRMReinaldo Morabito
- Mauricio C. de SouzaMSMauricio C. de Souza
- Mariana VazquezMVMariana Vazquez
- 1 February 2014
- journal article
- research article
- Published by Elsevier in European Journal of Operational Research
- Vol. 232 (3) , 618-629
Abstract
No abstract availableKeywords
This publication has 54 references indexed in Scilit:
- Topological arrangements of M/G/c/K, M/G/c/c queues in transportation and material handling systemsComputers & Operations Research, 2012
- Modelling complex assemblies as a queueing network for lead time controlEuropean Journal of Operational Research, 2006
- AN OVERVIEW OF TRADEOFF CURVES IN MANUFACTURING SYSTEMS DESIGNProduction and Operations Management, 1999
- STATE‐OF‐THE‐ART SURVEY: OPEN QUEUEING NETWORKS: OPTIMIZATION AND PERFORMANCE EVALUATION MODELS FOR DISCRETE MANUFACTURING SYSTEMSProduction and Operations Management, 1996
- Resource allocation in state-dependent emergency evacuation networksEuropean Journal of Operational Research, 1996
- Design of manufacturing systems using queueing modelsQueueing Systems, 1992
- Multiproduct Queueing Networks with Deterministic Routing: Decomposition Approach and the Notion of InterferenceManagement Science, 1988
- Projected Newton methods and optimization of multicommodity flowsIEEE Transactions on Automatic Control, 1983
- On Poisson Approximations for Superposition Arrival Processes in QueuesManagement Science, 1982
- Multicommodity network flows—A surveyNetworks, 1978