Pages that link to "Item:Q439320"
From MaRDI portal
The following pages link to Approximating a two-machine flow shop scheduling under discrete scenario uncertainty (Q439320):
Displayed 11 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)
- 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)
- 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)
- Approximation Schemes for Robust Makespan Scheduling Problems (Q2806953) (← 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)