Throughput maximization of queueing networks with simultaneous minimization of service rates and buffers

DOI10.1155/2012/692593zbMath1264.90054OpenAlexW2058760096WikidataQ58911585 ScholiaQ58911585MaRDI QIDQ1955082

Yanyan Li

Publication date: 11 June 2013

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2012/692593

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Queues and service in operations research (90B22) Deterministic network models in operations research (90B10)

Related Items (3)

Hybrid approach for buffer allocation in open serial production lines ⋮ Modeling and optimization of buffers and servers in finite queueing networks ⋮ An observer with controller to detect and reject disturbances

Cites Work

• Performance evaluation and dimensioning of \(GI^X/M/c/N\) systems through kernel estimation
• Upper bounds on performance measures of heterogeneous \(M/M/c\) queues
• The generalized expansion method for open finite queueing networks
• Conservation of filtering in manufacturing systems with unreliable machines and finished goods buffers
• Lean buffering in serial production lines with Bernoulli machines
• Suboptimal RED feedback control for buffered TCP flow dynamics in computer network
• An improved ARED algorithm for congestion control of network transmission
• Topological network design of general, finite, multi-server queueing networks
• An analytic finite capacity queueing network model capturing the propagation of congestion and blocking
• On the system optimum of traffic assignment in \(M/G/c/c\) state-dependent queueing networks
• Asymptotic behavior of the expansion method for open finite queueing networks
• Generalized \(M/G/C/C\) state dependent queueing models and pedestrian traffic flows
• Service and capacity allocation in \(M/G/c/c\) state-dependent queueing networks
• Optimal design and performance modelling of \(M/G/1/K\) queueing systems
• Modeling and optimization of M/G/1-type queueing networks: an efficient sensitivity analysis approach
• Multi-objective routing within large scale facilities using open finite queueing networks
• Performance optimization of open zero-buffer multi-server queueing networks
• Server allocation algorithms for tiered systems
• Solving the Knapsack problem with imprecise weight coefficients using genetic algorithms
• A new approach for solving linear bilevel problems using genetic algorithms
• Buffer allocation in general single-server queueing networks
• A repairable queueing model with two-phase service, start-up times and retrial customers
• Optimizing the throughput, service rate, and buffer allocation in finite queueing networks
• Concavity of the throughput of tandem queueing systems with finite buffer storage space
• Optimal Server Allocation in a System of Multi-Server Stations
• A Transform-Free Approximation for the Finite Capacity M/G/s Queue
• Genetic algorithm based approach to bi-level linear programming
• Stochastic Processes Occurring in the Theory of Queues and their Analysis by the Method of the Imbedded Markov Chain
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Throughput maximization of queueing networks with simultaneous minimization of service rates and buffers