Pages that link to "Item:Q2572850"
From MaRDI portal
The following pages link to The minmax regret permutation flow-shop problem with two jobs (Q2572850):
Displaying 9 items.
- The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective (Q342174) (← links)
- Two-stage minimax regret robust uncapacitated lot-sizing problems with demand uncertainty (Q408396) (← links)
- Approximating a two-machine flow shop scheduling under discrete scenario uncertainty (Q439320) (← links)
- Min-max and min-max regret versions of combinatorial optimization problems: A survey (Q1014933) (← links)
- Heuristic algorithms for the minmax regret flow-shop problem with interval processing times (Q1642853) (← links)
- Minimizing total weighted flow time under uncertainty using dominance and a stability box (Q1762112) (← links)
- Exact solutions for the two-machine robust flow shop with budgeted uncertainty (Q2670559) (← links)
- Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry (Q6109315) (← links)
- Efficient solutions to the \(m\)-machine robust flow shop under budgeted uncertainty (Q6588503) (← links)
