Pages that link to "Item:Q2865876"
From MaRDI portal
The following pages link to Theoretical aspects of scheduling coupled-tasks in the presence of compatibility graph (Q2865876):
Displaying 3 items.
- Parameterized complexity of a coupled-task scheduling problem (Q2283295) (← links)
- Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor (Q2434251) (← links)
- Some complexity and approximation results for coupled-tasks scheduling problem according to topology (Q2954345) (← links)