Pages that link to "Item:Q1790193"
From MaRDI portal
The following pages link to Complexity of interval minmax regret scheduling on parallel identical machines with total completion time criterion (Q1790193):
Displaying 6 items.
- Robust approach to restricted items selection problem (Q828685) (← links)
- Robust minmax regret combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios (Q1634058) (← links)
- Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty (Q1652531) (← links)
- Distributionally robust scheduling on parallel machines under moment uncertainty (Q1991203) (← links)
- Risk-averse single machine scheduling: complexity and approximation (Q2286434) (← links)
- Robust min-max regret scheduling to minimize the weighted number of late jobs with interval processing times (Q2288971) (← links)
