Pages that link to "Item:Q5931907"
From MaRDI portal
The following pages link to How good is a dense shop schedule? (Q5931907):
Displaying 7 items.
- Optimal results and numerical simulations for flow shop scheduling problems (Q410955) (← 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)
- The Open Shop Scheduling Problem (Q3304098) (← links)
- Polynomial time approximation algorithms for proportionate open‐shop scheduling (Q5246814) (← links)
