Pages that link to "Item:Q943795"
From MaRDI portal
The following pages link to A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion (Q943795):
Displayed 9 items.
- Approximating a two-machine flow shop scheduling under discrete scenario uncertainty (Q439320) (← links)
- On a constant factor approximation for minmax regret problems using a symmetry point scenario (Q439704) (← links)
- Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion (Q490241) (← links)
- Minimizing total weighted completion time with uncertain data: a stability approach (Q612208) (← links)
- A 2-approximation for minmax regret problems via a mid-point scenario optimal solution (Q991475) (← links)
- Minimizing total weighted flow time under uncertainty using dominance and a stability box (Q1762112) (← links)
- Measures of problem uncertainty for scheduling with interval processing times (Q2393127) (← links)
- A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines (Q2448222) (← links)
- JUST-IN-TIME SCHEDULING UNDER SCENARIO-BASED UNCERTAINTY (Q2836525) (← links)