Pages that link to "Item:Q2286434"
From MaRDI portal
The following pages link to Risk-averse single machine scheduling: complexity and approximation (Q2286434):
Displaying 11 items.
- Minimizing value-at-risk in single-machine scheduling (Q513548) (← links)
- Investigating the recoverable robust single machine scheduling problem under interval uncertainty (Q833004) (← links)
- Complexity of single machine scheduling problems under scenario-based uncertainty (Q943794) (← links)
- An adversarial model for scheduling with testing (Q2211361) (← links)
- Two-stage combinatorial optimization problems under risk (Q2283029) (← links)
- Complexity results for common due date scheduling problems with interval data and minmax regret criterion (Q2422739) (← links)
- Aversion scheduling in the presence of risky jobs (Q2432856) (← links)
- The distributionally robust machine scheduling problem with job selection and sequence-dependent setup times (Q2664350) (← links)
- Min–max version of single-machine scheduling with generalized due dates under scenario-based uncertainty (Q6094564) (← links)
- A stochastic bi-objective project scheduling model under failure of activities (Q6588491) (← links)
- Robust scheduling in a two-machine re-entrant flow shop to minimise the value-at-risk of the makespan: branch-and-bound and heuristic algorithms based on Markovian activity networks and phase-type distributions (Q6588502) (← links)
