Parametric scheduling -- algorithms and complexity
From MaRDI portal
Recommendations
- Parametric scheduling for network constraints
- A dual interpretation of ``standard constraints in parametric scheduling
- An analysis of partially Clairvoyant scheduling
- Parametric dispatching of hard real-time tasks
- Parametric approach to the specification and analysis of real-time scheduling based on ACSR-VP
Cited in
(12)- Parameter adaptation for generalized multiframe tasks: schedulability analysis, case study, and applications to self-suspending tasks
- On a decision procedure for quantified linear programs
- On contrasting vertex contraction with relaxation-based approaches for negative cost cycle detection
- A dual interpretation of ``standard constraints in parametric scheduling
- scientific article; zbMATH DE number 1256749 (Why is no real title available?)
- Parametric dispatching of hard real-time tasks
- Parametric scheduling for network constraints
- Parametric schedulability analysis of a launcher flight control system under reactivity constraints
- Zero-clairvoyant scheduling with inter-period constraints
- Parametric approach to the specification and analysis of real-time scheduling based on ACSR-VP
- scientific article; zbMATH DE number 7764095 (Why is no real title available?)
- Scheduling and fixed-parameter tractability
This page was built for publication: Parametric scheduling -- algorithms and complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4473910)