Static and dynamic server allocation in systems with on/off sources

DOI10.1007/S10479-008-0440-0zbMath1187.90096OpenAlexW2063962121MaRDI QIDQ839880

Nigel Thomas, Joris Slegers, Isi Mitrani

Publication date: 3 September 2009

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

Full work available at URL: https://doi.org/10.1007/s10479-008-0440-0

zbMATH Keywords

resource allocationdynamic optimizationbursty arrival sources

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Approximation methods and heuristics in mathematical programming (90C59) Queueing theory (aspects of probability theory) (60K25) Traffic problems in operations research (90B20)

Cites Work

• Unnamed Item
• Unnamed Item
• On optimal polling policies
• Structural results for the control of queueing systems using event-based dynamic programming
• Assigning a single server to inhomogeneous queues with switching costs
• Stochastic scheduling of parallel queues with set-up costs
• Optimal and heuristic policies for dynamic server allocation
• The cμ rule revisited
• Heuristic Scheduling of Parallel Heterogeneous Queues with Set-Ups
• The Interrupted Poisson Process As An Overflow Process

This page was built for publication: Static and dynamic server allocation in systems with on/off sources