Pages that link to "Item:Q2670559"
From MaRDI portal
The following pages link to Exact solutions for the two-machine robust flow shop with budgeted uncertainty (Q2670559):
Displaying 11 items.
- Approximating a two-machine flow shop scheduling under discrete scenario uncertainty (Q439320) (← links)
- A robust basic cyclic scheduling problem (Q668955) (← links)
- Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty (Q2286919) (← links)
- An uncertain permutation flow shop predictive scheduling problem with processing interruption (Q2683283) (← links)
- Average cost optimality for an unreliable two-machine flowshop with limited internal buffer (Q5933824) (← links)
- Maximizing total early work in a distributed two‐machine flow‐shop (Q6078603) (← links)
- Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry (Q6109315) (← links)
- A single representative min-max-min robust selection problem with alternatives and budgeted uncertainty (Q6130218) (← links)
- A distributionally robust approach for the two-machine permutation flow shop scheduling (Q6588501) (← links)
- Robust scheduling in a two-machine re-entrant flow shop to minimise the value-at-risk of the makespan: branch-and-bound and heuristic algorithms based on Markovian activity networks and phase-type distributions (Q6588502) (← links)
- Efficient solutions to the \(m\)-machine robust flow shop under budgeted uncertainty (Q6588503) (← links)
