Complexity of single machine scheduling problems under scenario-based uncertainty
From MaRDI portal
Recommendations
- Algorithms and complexity analysis for robust single-machine scheduling problems
- Risk-averse single machine scheduling: complexity and approximation
- Single machine scheduling with scenarios
- Just-in-time scheduling under scenario-based uncertainty
- Approximating Single Machine Scheduling with Scenarios
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion
- Minmax regret solutions for minimax optimization problems with uncertainty
- On the robust single machine scheduling problem
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
- Robust discrete optimization and its applications
Cited in
(40)- Minimizing the number of late jobs on a single machine under due date uncertainty
- Robustness in operational research and decision aiding: a multi-faceted issue
- Towards a robust scheduling on unrelated parallel machines: a scenarios based approach
- Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty
- A state-of-the-art survey on multi-scenario scheduling
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Online makespan minimization with budgeted uncertainty
- Investigating the recoverable robust single machine scheduling problem under interval uncertainty
- The complexity of machine scheduling for stability with a single disrupted job
- Distributionally robust single machine scheduling with risk aversion
- Min–max version of single-machine scheduling with generalized due dates under scenario-based uncertainty
- Single machine scheduling problems with uncertain parameters and the OWA criterion
- Distributionally robust scheduling on parallel machines under moment uncertainty
- Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty
- A robust two-machine flow-shop scheduling model with scenario-dependent processing times
- Minimizing value-at-risk in single-machine scheduling
- Single machine scheduling with scenarios
- Scheduling and packing under uncertainty
- Risk-averse single machine scheduling: complexity and approximation
- Exact algorithms based on a constrained shortest path model for robust serial-batch and parallel-batch scheduling problems
- Single machine robust scheduling with budgeted uncertainty
- A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty
- Total completion time scheduling under scenarios
- Approximating Single Machine Scheduling with Scenarios
- Robust single machine scheduling problem with weighted number of late jobs criterion
- Approximating a two-machine flow shop scheduling under discrete scenario uncertainty
- Lawler's minmax cost algorithm: optimality conditions and uncertainty
- Scheduling in multi-scenario environment with an agreeable condition on job processing times
- A single-machine scheduling problem with uncertainty in processing times and outsourcing costs
- Lawler's minmax cost problem under uncertainty
- Complexity results for common due date scheduling problems with interval data and minmax regret criterion
- Robust scheduling with budgeted uncertainty
- Approximation results for makespan minimization with budgeted uncertainty
- Parameterized multi-scenario single-machine scheduling problems
- Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty
- Robust min-max regret scheduling to minimize the weighted number of late jobs with interval processing times
- Distributionally robust single machine scheduling with the total tardiness criterion
- Min-max relative regret for scheduling to minimize maximum lateness
- Algorithms and complexity analysis for robust single-machine scheduling problems
- Just-in-time scheduling under scenario-based uncertainty
This page was built for publication: Complexity of single machine scheduling problems under scenario-based uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q943794)
