Pages that link to "Item:Q2883631"
From MaRDI portal
The following pages link to Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks (Q2883631):
Displaying 4 items.
- The coupled unit-time operations problem on identical parallel machines with respect to the makespan (Q1667166) (← links)
- Two-machine flowshop scheduling problem with coupled-operations (Q2327688) (← links)
- Some complexity and approximation results for coupled-tasks scheduling problem according to topology (Q2954345) (← links)
- Coupled-Tasks in Presence of Bipartite Compatibilities Graphs (Q3195325) (← links)
