Pages that link to "Item:Q2286919"
From MaRDI portal
The following pages link to Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty (Q2286919):
Displaying 7 items.
- Distributionally robust single machine scheduling with the total tardiness criterion (Q1628037) (← links)
- Minimizing the weighted sum of completion times under processing time uncertainty (Q1742192) (← links)
- Algorithms for minimizing maximum lateness with unit length tasks and resource constraints (Q1803669) (← links)
- Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times (Q2140270) (← links)
- Exact solutions for the two-machine robust flow shop with budgeted uncertainty (Q2670559) (← links)
- Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry (Q6109315) (← links)
- A single representative min-max-min robust selection problem with alternatives and budgeted uncertainty (Q6130218) (← links)
