Pages that link to "Item:Q1278237"
From MaRDI portal
The following pages link to The complexity of a cyclic scheduling problem with identical machines and precedence constraints (Q1278237):
Displaying 9 items.
- A cyclic scheduling problem with an undetermined number of parallel identical processors (Q626651) (← links)
- Deadline constrained cyclic scheduling on pipelined dedicated processors considering multiprocessor tasks and changeover times (Q947867) (← links)
- Study of a NP-hard cyclic scheduling problem: The recurrent job-shop (Q1319564) (← links)
- On scheduling cycle shops: Classification, complexity and approximation (Q1600002) (← links)
- Grouping tasks to save energy in a cyclic scheduling problem: a complexity study (Q2178065) (← links)
- Balancing perfectly periodic service schedules: An application from recycling and waste management (Q3166688) (← links)
- Fixed Cycle Scheduling: A Solvable Problem with Empty Precedence Structure (Q3197613) (← links)
- (Q3358512) (← links)
- Complexity of cyclic job shop scheduling problems for identical jobs with no-wait constraints (Q5090138) (← links)