Pages that link to "Item:Q1960318"
From MaRDI portal
The following pages link to A polynomial algorithm for the three-machine open shop with a bottleneck machine (Q1960318):
Displayed 7 items.
- Two-stage open shop scheduling with a bottleneck machine (Q1592745) (← links)
- Three-machine open shop with a bottleneck machine revisited (Q2061137) (← links)
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
- Open-shop dense schedules: properties and worst-case performance ratio (Q2434260) (← links)
- A complete 4-parametric complexity classification of short shop scheduling problems (Q2434295) (← links)
- Some positive news on the proportionate open shop problem (Q2633607) (← links)