Optimization of Multiclass Queueing Networks with Changeover Times Via the Achievable Region Approach: Part I, The Single-Station Case

DOI10.1287/moor.24.2.306zbMath0977.90006OpenAlexW2119339775MaRDI QIDQ2757597

José Niño-Mora, Dimitris J. Bertsimas

Publication date: 26 November 2001

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

Full work available at URL: https://doi.org/10.1287/moor.24.2.306

zbMATH Keywords

queueing networksperformance boundscheduling policy

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (6)

Maximum weight matching with hysteresis in overloaded queues with setups ⋮ Analysis of transient queues with semidefinite optimization ⋮ Exponential penalty function control of loss networks ⋮ Validity of heavy traffic steady-state approximations in generalized Jackson networks ⋮ On deciding stability of multiclass queueing networks under buffer priority scheduling policies ⋮ A Marginal Productivity Index Rule for Scheduling Multiclass Queues with Setups

This page was built for publication: Optimization of Multiclass Queueing Networks with Changeover Times Via the Achievable Region Approach: Part I, The Single-Station Case