The basic cyclic scheduling problem with linear precedence constraints
From MaRDI portal
Recommendations
- Periodic schedules for linear precedence constraints
- A graph-based analysis of the cyclic scheduling problem with time constraints: schedulability and periodicity of the earliest schedule
- Résolution d'un problème d'ordonnancement cyclique à itérations indépendantes et contraintes de ressources
- Cyclic scheduling problems with linear precedences and resource constraints
Cites work
- scientific article; zbMATH DE number 3921988 (Why is no real title available?)
- scientific article; zbMATH DE number 3302125 (Why is no real title available?)
- An approximation algorithm for scheduling dependent tasks on \(m\) processors with small communication delays
- The basic cyclic scheduling problem with deadlines
Cited in
(11)- A genetic approach to solving the problem of cyclic job shop scheduling with linear constraints
- A graph-based analysis of the cyclic scheduling problem with time constraints: schedulability and periodicity of the earliest schedule
- Periodic schedules for linear precedence constraints
- Minimizing place capacities of weighted event graphs for enforcing liveness
- Cyclic scheduling problems with linear precedences and resource constraints
- Fixed Cycle Scheduling: A Solvable Problem with Empty Precedence Structure
- A robust basic cyclic scheduling problem
- The basic cyclic scheduling problem with deadlines
- A note on periodic schedules for linear precedence constraints
- A study of the cyclic scheduling problem on parallel processors
- Max-plus algebraic description of evolutions of weighted timed event graphs
This page was built for publication: The basic cyclic scheduling problem with linear precedence constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1917250)
