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

DOI10.1016/J.EJOR.2013.08.014zbMATH Open1305.90087DBLPjournals/eor/MorabitoSV14OpenAlexW1973143286WikidataQ57719417 ScholiaQ57719417MaRDI QIDQ2255986FDOQ2255986

Authors: Reinaldo Morabito, Maurício C. de Souza, Mariana Vazquez 

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

Recommendations

• An approximation algorithm for multiroute flow decomposition
• Approximation of multiclass queueing networks with highly variable arrivals under deterministic routing
• A decomposition algorithm for multi-terminal network flows
• Multiproduct Queueing Networks with Deterministic Routing: Decomposition Approach and the Notion of Interference
• An analysis of an approximation algorithm for queueing networks
• Multicommodity flow problems and decomposition in telecommunications networks
• Solving Multicommodity Flow Problems by an Approximation Scheme
• Multicommodity network flows: The impact of formulation on decomposition
• Asymptotically exact decomposition approximations for open queueing networks
• Decomposition and aggregation in queueing networks

zbMATH Keywords

networksmulticommodity flowsqueuingapproximate decomposition methodsgeneralized open queuing networks

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2255986)