Pages that link to "Item:Q1042485"
From MaRDI portal
The following pages link to Scheduling incompatible tasks on two machines (Q1042485):
Displaying 3 items.
- A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions (Q2029954) (← links)
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
- Two-dedicated-machine scheduling problem with precedence relations to minimize makespan (Q2448211) (← links)
