Pages that link to "Item:Q2466597"
From MaRDI portal
The following pages link to Three is easy, two is hard: Open shop sum-batch scheduling problem refined (Q2466597):
Displaying 5 items.
- Minimizing makespan for multi-spindle head machines with a mobile table (Q954031) (← 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)
- A cyclical search for the two machine flow shop and open shop to minimise finishing time (Q2356124) (← links)
- Transporting jobs through a two‐machine open shop (Q3621908) (← links)