A study of the cyclic scheduling problem on parallel processors
From MaRDI portal
Publication:1346694
DOI10.1016/0166-218X(94)00102-JzbMath0830.68009OpenAlexW2040414745MaRDI QIDQ1346694
Publication date: 10 April 1995
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(94)00102-j
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (28)
Cyclic robot scheduling for 3D printer-based flexible assembly systems ⋮ The resource-constrained modulo scheduling problem: an experimental study ⋮ Evaluating topological ordering in directed acyclic graphs ⋮ Converging to periodic schedules for cyclic scheduling problems with resources and deadlines ⋮ Applications of max-plus algebra to flow shop scheduling problems ⋮ Tabu search algorithms for cyclic machine scheduling problems ⋮ Performance bounds for stochastic timed Petri nets ⋮ SIRALINA: Efficient two-steps heuristic for storage optimisation in single period task scheduling ⋮ A cyclic scheduling problem with an undetermined number of parallel identical processors ⋮ An algebraic expression of the number partitioning problem ⋮ Approximation algorithms for precedence-constrained identical machine scheduling with rejection ⋮ A graph-based analysis of the cyclic scheduling problem with time constraints: schedulability and periodicity of the earliest schedule ⋮ Complexity results for weighted timed event graphs ⋮ Worst case analysis of decomposed software pipelining for cyclic unitary RCPSP with precedence delays ⋮ Cyclic flowshop scheduling with operators and robots: Vyacheslav Tanaev's vision and lasting contributions ⋮ Model predictive scheduling of semi-cyclic discrete-event systems using switching max-plus linear models and dynamic graphs ⋮ Cyclic scheduling for F.M.S.: Modelling and evolutionary solving approach ⋮ Deadline constrained cyclic scheduling on pipelined dedicated processors considering multiprocessor tasks and changeover times ⋮ An approximation algorithm for scheduling dependent tasks on \(m\) processors with small communication delays ⋮ Scheduling with periodic availability constraints and irregular cost functions ⋮ Periodic schedules for linear precedence constraints ⋮ A sufficient condition for the liveness of weighted event graphs ⋮ Généralisation Max-Plus des bornes de Lageweg, Lenstra et Rinnooy Kan ⋮ The complexity of a cyclic scheduling problem with identical machines and precedence constraints ⋮ Alternation Graphs ⋮ List schedules for cyclic scheduling ⋮ Efficient Method for Periodic Task Scheduling with Storage Requirement Minimization ⋮ On scheduling cycle shops: Classification, complexity and approximation
Cites Work
- Unnamed Item
- The basic cyclic scheduling problem with deadlines
- Study of a NP-hard cyclic scheduling problem: The recurrent job-shop
- Scheduling with Deadlines and Loss Functions
- A linear-system-theoretic view of discrete-event processes and its use for performance evaluation in manufacturing
- Résolution d'un problème d'ordonnancement cyclique à itérations indépendantes et contraintes de ressources
- Scheduling Sequential Loops on Parallel Processors
- Performance evaluation of job-shop systems using timed event-graphs
- A Mathematical Model for Periodic Scheduling Problems
- Un domaine très ouvert : les problèmes d'ordonnancement
- Cyclic Schedules for Job Shops with Identical Jobs
This page was built for publication: A study of the cyclic scheduling problem on parallel processors
