Pages that link to "Item:Q439320"

The following pages link to Approximating a two-machine flow shop scheduling under discrete scenario uncertainty (Q439320):

Displaying 22 items.

• Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty (Q322893) (← links)
• Minimizing value-at-risk in single-machine scheduling (Q513548) (← links)
• Online makespan minimization with budgeted uncertainty (Q832833) (← links)
• Distributionally robust single machine scheduling with the total tardiness criterion (Q1628037) (← 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)
• An improved genetic algorithm for single-machine inverse scheduling problem (Q1718215) (← links)
• Scheduling in multi-scenario environment with an agreeable condition on job processing times (Q2070719) (← links)
• On the complexity of constructing a minmax regret solution for the two-machine flow shop problem under the interval uncertainty (Q2215204) (← links)
• A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines (Q2448222) (← links)
• Exact solutions for the two-machine robust flow shop with budgeted uncertainty (Q2670559) (← links)
• Approximation Schemes for Robust Makespan Scheduling Problems (Q2806953) (← links)
• Combining prospect theory with fuzzy theory to handle disruption in production scheduling (Q5024608) (← links)
• Exact Algorithms for Distributionally <i>β</i>-Robust Machine Scheduling with Uncertain Processing Times (Q5137951) (← links)
• Towards a Robust Scheduling on Unrelated Parallel Machines: A Scenarios Based Approach (Q5357767) (← links)
• Approximation results for makespan minimization with budgeted uncertainty (Q5919095) (← links)
• Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry (Q6109315) (← links)
• A state-of-the-art survey on multi-scenario scheduling (Q6113303) (← links)
• Optimal scenario reduction for one- and two-stage robust optimization with discrete uncertainty in the objective (Q6113355) (← links)
• Single machine robust scheduling with budgeted uncertainty (Q6161900) (← links)
• A distributionally robust approach for the two-machine permutation flow shop scheduling (Q6588501) (← links)
• Efficient solutions to the \(m\)-machine robust flow shop under budgeted uncertainty (Q6588503) (← links)