Complexity of single machine scheduling problems under scenario-based uncertainty
From MaRDI portal
Publication:943794
DOI10.1016/j.orl.2007.11.005zbMath1151.90390OpenAlexW2006049518MaRDI QIDQ943794
Mohamed Ali Aloulou, Frederico Della Croce
Publication date: 10 September 2008
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2007.11.005
Related Items
Single machine scheduling problems with uncertain parameters and the OWA criterion, Online makespan minimization with budgeted uncertainty, Investigating the recoverable robust single machine scheduling problem under interval uncertainty, Distributionally robust single machine scheduling with the total tardiness criterion, Lawler's minmax cost algorithm: optimality conditions and uncertainty, Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty, Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty, Lawler's minmax cost problem under uncertainty, Robust scheduling with budgeted uncertainty, Min–max version of single-machine scheduling with generalized due dates under scenario-based uncertainty, Complexity results for common due date scheduling problems with interval data and minmax regret criterion, A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty, Exact algorithms based on a constrained shortest path model for robust serial-batch and parallel-batch scheduling problems, A state-of-the-art survey on multi-scenario scheduling, Towards a Robust Scheduling on Unrelated Parallel Machines: A Scenarios Based Approach, Parameterized multi-scenario single-machine scheduling problems, Single machine robust scheduling with budgeted uncertainty, Min-max relative regret for scheduling to minimize maximum lateness, Algorithms and complexity analysis for robust single-machine scheduling problems, Approximating a two-machine flow shop scheduling under discrete scenario uncertainty, Minimizing the number of late jobs on a single machine under due date uncertainty, Minimizing value-at-risk in single-machine scheduling, Distributionally robust scheduling on parallel machines under moment uncertainty, Distributionally robust single machine scheduling with risk aversion, Risk-averse single machine scheduling: complexity and approximation, Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty, Robust min-max regret scheduling to minimize the weighted number of late jobs with interval processing times, Robust Single Machine Scheduling Problem with Weighted Number of Late Jobs Criterion, Approximation results for makespan minimization with budgeted uncertainty, Min-max and min-max regret versions of combinatorial optimization problems: A survey, Scheduling in multi-scenario environment with an agreeable condition on job processing times, JUST-IN-TIME SCHEDULING UNDER SCENARIO-BASED UNCERTAINTY, Robustness in operational research and decision aiding: a multi-faceted issue, A robust two-machine flow-shop scheduling model with scenario-dependent processing times
Cites Work
- On the robust single machine scheduling problem
- Robust discrete optimization and its applications
- Minmax regret solutions for minimax optimization problems with uncertainty
- Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
- Unnamed Item
