Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks

DOI10.1016/j.ejor.2013.08.014zbMath1305.90087OpenAlexW1973143286WikidataQ57719417 ScholiaQ57719417MaRDI QIDQ2255986

Mariana Vazquez, Mauricio C. de Souza, Reinaldo Morabito

Publication date: 18 February 2015

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2013.08.014

zbMATH Keywords

networksqueuingmulticommodity flowsapproximate decomposition methodsgeneralized open queuing networks

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Deterministic network models in operations research (90B10)

Related Items (3)

Stochastic lot sizing manufacturing under the ETS system for maximisation of shareholder wealth ⋮ Capacity planning for a maintenance service provider with advanced information ⋮ Allocation of flows in closed bipartite queueing networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Simultaneous determination of lot size and production rate at capacity-constrained multiple-product systems
• Modelling complex assemblies as a queueing network for lead time control
• The QNET method for two-moment analysis of open queueing networks
• Multi-objective evacuation routing in transportation networks
• Topological network design of general, finite, multi-server queueing networks
• Design of manufacturing systems using queueing models
• Resource allocation in state-dependent emergency evacuation networks
• Topological arrangements of \(M/G/c/K\), \(M/G/c/c\) queues in transportation and material handling systems
• Design of intermodal logistics networks with hub delays
• Performance evaluation for general queueing networks in manufacturing systems: characterizing the trade-off between queue time and utilization
• Multi-objective routing within large scale facilities using open finite queueing networks
• A minimum mean cycle cancelling method for nonlinear multicommodity flow problems
• Projected Newton methods and optimization of multicommodity flows
• Performance evaluation and capacity planning in a metallurgical job-shop system using open queueing network models
• Resource Allocation in Multisite Service Systems with Intersite Customer Flows
• A Survey of Algorithms for Convex Multicommodity Flow Problems
• Robustness of state-dependent queues and material handling systems
• Implementing a proximal algorithm for some nonlinear multicommodity flow problems
• Open and Closed Models for Networks of Queues
• The Best Order for Queues in Series
• Multiproduct Queueing Networks with Deterministic Routing: Decomposition Approach and the Notion of Interference
• On Poisson Approximations for Superposition Arrival Processes in Queues
• Multicommodity network flows—A survey
• Approximate Analysis of General Queuing Networks by Decomposition
• A new proximal decomposition algorithm for routing in telecommunication networks
• Optimal server assignment for a multiple customer classes problem
• Two-stage make-to-order remanufacturing with service-level constraints
• Networks of Waiting Lines
• Cycle‐based algorithms for multicommodity network flow problems with separable piecewise convex costs
• The flow deviation method: An approach to store‐and‐forward communication network design
• A delay dependent queue discipline
• Some Inequalities in Queuing
• Evaluating focused factory benefits with queuing theory
• Determining the value of dedicated multimodal cargo facilities in a multi-region distribution network

This page was built for publication: Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks