Pages that link to "Item:Q906553"
From MaRDI portal
The following pages link to Algorithms and complexity analysis for robust single-machine scheduling problems (Q906553):
Displayed 17 items.
- Online makespan minimization with budgeted uncertainty (Q832833) (← links)
- Distributionally robust single machine scheduling with the total tardiness criterion (Q1628037) (← links)
- Robust combinatorial optimization with knapsack uncertainty (Q1662111) (← links)
- Minimizing the weighted sum of completion times under processing time uncertainty (Q1742192) (← links)
- Distributionally robust single machine scheduling with risk aversion (Q1752194) (← links)
- Distributionally robust scheduling on parallel machines under moment uncertainty (Q1991203) (← links)
- Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty (Q2125227) (← links)
- Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty (Q2286919) (← links)
- Robust scheduling with budgeted uncertainty (Q2414457) (← links)
- A robust optimization approach for the unrelated parallel machine scheduling problem (Q2701168) (← links)
- Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty (Q5046625) (← links)
- Exact Algorithms for Distributionally <i>β</i>-Robust Machine Scheduling with Uncertain Processing Times (Q5137951) (← links)
- Approximation results for makespan minimization with budgeted uncertainty (Q5919095) (← links)
- Exact algorithms based on a constrained shortest path model for robust serial-batch and parallel-batch scheduling problems (Q6106966) (← links)
- Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry (Q6109315) (← links)
- Single machine robust scheduling with budgeted uncertainty (Q6161900) (← links)
- Min-max relative regret for scheduling to minimize maximum lateness (Q6182890) (← links)