Queueing dynamics and maximal throughput scheduling in switched processing systems

DOI10.1023/A:1024714024248zbMath1035.90017OpenAlexW4244195983MaRDI QIDQ1403391

Mor Armony, Nicholas Bambos

Publication date: 1 September 2003

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1024714024248

zbMATH Keywords

dynamic schedulingthroughput maximizationadaptive batching policiescone policiesswitched processing systemstrace-based modeling

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Related Items (15)

Polling: past, present, and perspective ⋮ Maximum weight matching with hysteresis in overloaded queues with setups ⋮ Dynamic scheduling with reconfiguration delays ⋮ Optimal routing for electric vehicle service systems ⋮ Dynamic power control in a fading downlink channel subject to an energy constraint ⋮ SCHEDULING IN A QUEUING SYSTEM WITH ASYNCHRONOUSLY VARYING SERVICE RATES ⋮ Uniform design over general input domains with applications to target region estimation in computer experiments ⋮ A survey on skill-based routing with applications to service operations management ⋮ Locating Infinite Discontinuities in Computer Experiments ⋮ Stochastic scheduling: a short history of index policies and new approaches to index generation for dynamic resource allocation ⋮ A queueing analysis of max-min fairness, proportional fairness and balanced fairness ⋮ Dynamic scheduling for switched processing systems with substantial service-mode switching times ⋮ Stability of spatial queueing systems ⋮ Queueing and scheduling in random environments ⋮ Dynamic routing in large-scale service systems with heterogeneous servers

This page was built for publication: Queueing dynamics and maximal throughput scheduling in switched processing systems