Optimal scheduling for constant-rate multi-mode systems
From MaRDI portal
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)
Recommendations
- A Cross-Layer View of Optimal Scheduling
- Optimal rate-based scheduling on multiprocessors
- Optimal Scheduling of Multiclass Stochastic Systems
- Throughput optimal scheduling policies in networks of constrained queues
- Optimal dynamic scheduling of a general class of parallel-processing queueing systems
- Optimal scheduling of interactive and noninteractive traffic in telecommunication systems
- Stable Scheduling Policies for Maximizing Throughput in Generalized Constrained Queueing Systems
Cited in
(6)- Optimal multi-TDMA scheduling in ring topology networks
- Optimal control for multi-mode systems with discrete costs
- Optimal control for linear-rate multi-mode systems
- Safe schedulability of bounded-rate multi-mode systems
- The complexity of linear temporal verification for continuous counter systems
- Verifying linear temporal properties on polyhedral systems: decidability and symbolic algorithms
This page was built for publication: Optimal scheduling for constant-rate multi-mode systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2986754)