Pages that link to "Item:Q1362528"
From MaRDI portal
The following pages link to Minimizing the total completion time in a unit-time open shop with release times (Q1362528):
Displaying 4 items.
- Unit-time scheduling problems with time dependent resources (Q678109) (← links)
- The complexity of mean flow time scheduling problems with release times (Q880590) (← links)
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (Q1399579) (← links)
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← links)
