Pages that link to "Item:Q1346694"
From MaRDI portal
The following pages link to A study of the cyclic scheduling problem on parallel processors (Q1346694):
Displaying 28 items.
- Converging to periodic schedules for cyclic scheduling problems with resources and deadlines (Q337140) (← links)
- SIRALINA: Efficient two-steps heuristic for storage optimisation in single period task scheduling (Q411217) (← links)
- Complexity results for weighted timed event graphs (Q429654) (← links)
- A cyclic scheduling problem with an undetermined number of parallel identical processors (Q626651) (← links)
- A graph-based analysis of the cyclic scheduling problem with time constraints: schedulability and periodicity of the earliest schedule (Q633540) (← links)
- Cyclic robot scheduling for 3D printer-based flexible assembly systems (Q829186) (← links)
- Tabu search algorithms for cyclic machine scheduling problems (Q880506) (← links)
- Cyclic scheduling for F.M.S.: Modelling and evolutionary solving approach (Q933521) (← links)
- Deadline constrained cyclic scheduling on pipelined dedicated processors considering multiprocessor tasks and changeover times (Q947867) (← links)
- Periodic schedules for linear precedence constraints (Q1003670) (← links)
- A sufficient condition for the liveness of weighted event graphs (Q1014950) (← links)
- The complexity of a cyclic scheduling problem with identical machines and precedence constraints (Q1278237) (← links)
- List schedules for cyclic scheduling (Q1293196) (← links)
- On scheduling cycle shops: Classification, complexity and approximation (Q1600002) (← links)
- Applications of max-plus algebra to flow shop scheduling problems (Q1671348) (← links)
- Approximation algorithms for precedence-constrained identical machine scheduling with rejection (Q1698078) (← links)
- An algebraic expression of the number partitioning problem (Q2197434) (← links)
- Model predictive scheduling of semi-cyclic discrete-event systems using switching max-plus linear models and dynamic graphs (Q2220346) (← links)
- The resource-constrained modulo scheduling problem: an experimental study (Q2377171) (← links)
- Worst case analysis of decomposed software pipelining for cyclic unitary RCPSP with precedence delays (Q2434252) (← links)
- Cyclic flowshop scheduling with operators and robots: Vyacheslav Tanaev's vision and lasting contributions (Q2434294) (← links)
- Alternation Graphs (Q3104776) (← links)
- Scheduling with periodic availability constraints and irregular cost functions (Q3598681) (← links)
- Evaluating topological ordering in directed acyclic graphs (Q5061711) (← links)
- Performance bounds for stochastic timed Petri nets (Q5096370) (← links)
- Généralisation Max-Plus des bornes de Lageweg, Lenstra et Rinnooy Kan (Q5479832) (← links)
- Efficient Method for Periodic Task Scheduling with Storage Requirement Minimization (Q5505681) (← links)
- An approximation algorithm for scheduling dependent tasks on \(m\) processors with small communication delays (Q5929309) (← links)