Combinatorial optimization in real-time scheduling: Theory and algorithms
From MaRDI portal
Recommendations
- Optimal scheduling combinatorics
- Algorithms and complexity for periodic real-time scheduling
- Algorithms and complexity for periodic real-time scheduling
- Evaluating typical algorithms of combinatorial optimization to solve continuous-time based scheduling problem
- Open problems in real-time scheduling
- An optimal scheduling algorithm for preemptable real-time tasks
- Fast combination of scheduling chains under resource and time constraints
- Improvements in throughout maximization for real-time scheduling
- Optimal real-time scheduling with minimal rejections and minimal finishing time
Cited in
(6)- On the robustness of a synchronized multi-robot system
- Tower-of-sets analysis for the Kise-Ibaraki-Mine algorithm
- scientific article; zbMATH DE number 1852165 (Why is no real title available?)
- Integer programming approach for schedulability of sporadic real-time systems
- Optimal real-time scheduling with minimal rejections and minimal finishing time
- Fast combination of scheduling chains under resource and time constraints
This page was built for publication: Combinatorial optimization in real-time scheduling: Theory and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5952322)