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 24 items.
- Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty (Q322893) (← links)
- Scheduling under linear constraints (Q323163) (← links)
- The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective (Q342174) (← links)
- 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)
- Optimality region for job permutation in single-machine scheduling with uncertain processing times (Q827990) (← links)
- Investigating the recoverable robust single machine scheduling problem under interval uncertainty (Q833004) (← links)
- A 2-approximation for minmax regret problems via a mid-point scenario optimal solution (Q991475) (← links)
- Robust minmax regret combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios (Q1634058) (← 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)
- Complexity of interval minmax regret scheduling on parallel identical machines with total completion time criterion (Q1790193) (← links)
- A single-machine scheduling problem with uncertainty in processing times and outsourcing costs (Q1992893) (← links)
- Robust discrete spanning tree problem: local search algorithms (Q2085475) (← links)
- Single machine scheduling problem with interval processing times and total completion time objective (Q2283853) (← 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)
- Min–max regret criterion-based robust model for the permutation flow-shop scheduling problem (Q5059343) (← links)
- Exact Algorithms for Distributionally <i>β</i>-Robust Machine Scheduling with Uncertain Processing Times (Q5137951) (← links)
- Min–max version of single-machine scheduling with generalized due dates under scenario-based uncertainty (Q6094564) (← links)
- Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry (Q6109315) (← links)