A study of the cyclic scheduling problem on parallel processors
From MaRDI portal
Recommendations
- A graph-based analysis of the cyclic scheduling problem with time constraints: schedulability and periodicity of the earliest schedule
- scientific article; zbMATH DE number 850294
- The basic cyclic scheduling problem with linear precedence constraints
- Résolution d'un problème d'ordonnancement cyclique à itérations indépendantes et contraintes de ressources
- Scheduling Periodic Tasks
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A Mathematical Model for Periodic Scheduling Problems
- A linear-system-theoretic view of discrete-event processes and its use for performance evaluation in manufacturing
- Cyclic Schedules for Job Shops with Identical Jobs
- Performance evaluation of job-shop systems using timed event-graphs
- Résolution d'un problème d'ordonnancement cyclique à itérations indépendantes et contraintes de ressources
- Scheduling Sequential Loops on Parallel Processors
- Scheduling with deadlines and loss functions
- Study of a NP-hard cyclic scheduling problem: The recurrent job-shop
- The basic cyclic scheduling problem with deadlines
- Un domaine très ouvert : les problèmes d'ordonnancement
Cited in
(38)- A bound analysis of scheduling instructions on pipelined processors with a maximal delay of one cycle
- 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
- A parallel approach to the Eulerian cycle problem
- Efficient Method for Periodic Task Scheduling with Storage Requirement Minimization
- Evaluating topological ordering in directed acyclic graphs
- Cyclic flowshop scheduling with operators and robots: Vyacheslav Tanaev's vision and lasting contributions
- On Graham's bound for cyclic scheduling
- Periodic assignment and graph colouring
- The cyclical scheduling problem
- Généralisation Max-Plus des bornes de Lageweg, Lenstra et Rinnooy Kan
- The cyclical scheduling problem
- Cyclic robot scheduling for 3D printer-based flexible assembly systems
- An approximation algorithm for scheduling dependent tasks on \(m\) processors with small communication delays
- A sufficient condition for the liveness of weighted event graphs
- Complexity results for weighted timed event graphs
- Grouping tasks to save energy in a cyclic scheduling problem: a complexity study
- An algebraic expression of the number partitioning problem
- Deadline constrained cyclic scheduling on pipelined dedicated processors considering multiprocessor tasks and changeover times
- SIRALINA: Efficient two-steps heuristic for storage optimisation in single period task scheduling
- Scheduling with periodic availability constraints and irregular cost functions
- Alternation graphs
- Tabu search algorithms for cyclic machine scheduling problems
- The complexity of a cyclic scheduling problem with identical machines and precedence constraints
- List schedules for cyclic scheduling
- Model predictive scheduling of semi-cyclic discrete-event systems using switching max-plus linear models and dynamic graphs
- Worst case analysis of decomposed software pipelining for cyclic unitary RCPSP with precedence delays
- Approximation algorithms for precedence-constrained identical machine scheduling with rejection
- The resource-constrained modulo scheduling problem: an experimental study
- Cyclic schedules for r irregularity occurring events
- Performance bounds for stochastic timed Petri nets
- Performance of critical path type algorithms for scheduling on parallel processors
- Converging to periodic schedules for cyclic scheduling problems with resources and deadlines
- Cyclic scheduling for F.M.S.: Modelling and evolutionary solving approach
- Applications of max-plus algebra to flow shop scheduling problems
- A cyclic scheduling problem with an undetermined number of parallel identical processors
- PARAdeg-processor scheduling for acyclic SWITCH-less program nets
- On scheduling cycle shops: Classification, complexity and approximation
This page was built for publication: A study of the cyclic scheduling problem on parallel processors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1346694)
