Robust single machine scheduling problem with weighted number of late jobs criterion
From MaRDI portal
Publication:2806942
Recommendations
- Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty
- Algorithms and complexity analysis for robust single-machine scheduling problems
- Minimizing the number of late jobs on a single machine under due date uncertainty
- Single machine scheduling problems with uncertain parameters and the OWA criterion
- Single machine scheduling with scenarios
Cites work
- Approximating the min-max (regret) selecting items problem
- Combinatorial optimization problems with uncertain costs and the OWA criterion
- Complexity of single machine scheduling problems under scenario-based uncertainty
- Improved approximation algorithms for the Min-Max selecting items problem
- Minimizing the number of late jobs on a single machine under due date uncertainty
- On ordered weighted averaging aggregation operators in multicriteria decisionmaking
Cited in
(7)- Minimizing the number of late jobs on a single machine under due date uncertainty
- A state-of-the-art survey on multi-scenario scheduling
- Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty
- Risk-averse single machine scheduling: complexity and approximation
- A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty
- A robust approach for the single machine scheduling problem
- Parameterized multi-scenario single-machine scheduling problems
This page was built for publication: Robust single machine scheduling problem with weighted number of late jobs criterion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2806942)
