Pages that link to "Item:Q5059343"
From MaRDI portal
The following pages link to Min–max regret criterion-based robust model for the permutation flow-shop scheduling problem (Q5059343):
Displaying 4 items.
- Heuristic algorithms for the minmax regret flow-shop problem with interval processing times (Q1642853) (← links)
- An uncertain permutation flow shop predictive scheduling problem with processing interruption (Q2683283) (← links)
- No-Wait Flow Shop scheduling problem: a systematic literature review and bibliometric analysis (Q6127701) (← links)
- Efficient solutions to the \(m\)-machine robust flow shop under budgeted uncertainty (Q6588503) (← links)