Combining routing and buffer allocation problems in series-parallel queueing networks

DOI10.1023/B:ANOR.0000011185.77227.aezbMath1040.90005OpenAlexW2012850061MaRDI QIDQ1424895

Sophia Daskalaki, James MacGregor Smith

Publication date: 15 March 2004

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:anor.0000011185.77227.ae

zbMATH Keywords

queueing networksoptimal routingfinite buffersmulti-objective stochastic nonlinear programmingtwo-stage iterative optimization

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Stochastic programming (90C15) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (6)

Buffer allocation for a class of nonlinear stochastic knapsack problems ⋮ Optimal Routing in Closed Queueing Networks with State Dependent Queues ⋮ Modeling and optimization of buffers and servers in finite queueing networks ⋮ Optimal buffer allocation in finite closed networks with multiple servers ⋮ Selecting machines and buffers in unreliable series-parallel production lines ⋮ Open finite queueing networks with \(M/M/C/K\) parallel servers

This page was built for publication: Combining routing and buffer allocation problems in series-parallel queueing networks