Pages that link to "Item:Q1642853"
From MaRDI portal
The following pages link to Heuristic algorithms for the minmax regret flow-shop problem with interval processing times (Q1642853):
Displaying 3 items.
- Exact solutions for the two-machine robust flow shop with budgeted uncertainty (Q2670559) (← links)
- Min–max regret criterion-based robust model for the permutation flow-shop scheduling problem (Q5059343) (← links)
- Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry (Q6109315) (← links)
