Scheduling in multiclass networks with deterministic service times

DOI10.1023/A:1016241214158zbMATH Open0993.90046OpenAlexW1488182648MaRDI QIDQ1611751FDOQ1611751

Authors: Rhonda Righter 

Publication date: 28 August 2002

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

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

Recommendations

• Scheduling in a multi-class series of queues with deterministic service times
• Dynamic Scheduling of a Multiclass Fluid Network
• Scheduling to Differentiate Service in a Multiclass Service System
• Scheduling in switching networks with set-up delays
• Optimal Scheduling of Multiclass Stochastic Systems
• Scheduling in synchronous networks and the greedy algorithm
• Task scheduling in networks

zbMATH Keywords

schedulingstochastic dynamic programmingrestless banditsmobile communications

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Stochastic programming (90C15)

Cited In (6)

• Scheduled service network design with quality targets and stochastic travel times
• Lex-Optimal Online Multiclass Scheduling with Hard Deadlines
• Control of end-to-end delay tails in a multiclass network: LWDF discipline optimality
• On the Variance of the Least Attained Service Policy and Its Use in Multiple Bottleneck Networks
• Scheduling to Differentiate Service in a Multiclass Service System
• Title not available (Why is that?)

This page was built for publication: Scheduling in multiclass networks with deterministic service times

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1611751)