New algorithms for coupled tasks scheduling - a survey
From MaRDI portal
Recommendations
- Complexity of scheduling of coupled tasks with chains precedence constraints and constant even length of the gap
- Scheduling of coupled tasks with unit processing times
- Identical coupled task scheduling: polynomial complexity of the cyclic case
- A note on scheduling identical coupled tasks in logarithmic time
- An exact algorithm for scheduling identical coupled tasks
Cited in
(10)- Scheduling coupled tasks with exact delays for minimum total job completion time
- Coupled task scheduling with exact delays: literature review and models
- Parameterized complexity of a coupled-task scheduling problem
- Two-machine flowshop scheduling problem with coupled-operations
- Complexity of scheduling problem in single-machine flexible manufacturing system with cyclic transportation and unlimited buffers
- Complexity of scheduling of coupled tasks with chains precedence constraints and constant even length of the gap
- Scheduling of coupled tasks with unit processing times
- A binary search algorithm for the general coupled task scheduling problem
- Identical coupled task scheduling: polynomial complexity of the cyclic case
- A note on scheduling identical coupled tasks in logarithmic time
This page was built for publication: New algorithms for coupled tasks scheduling - a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4917224)