Distributionally robust single machine scheduling with risk aversion
From MaRDI portal
Recommendations
- Distributionally robust scheduling on parallel machines under moment uncertainty
- Target-based distributionally robust optimization for single machine scheduling
- Distributionally robust single machine scheduling with the total tardiness criterion
- Minimizing value-at-risk in single-machine scheduling
- Exact algorithms for distributionally \(\beta \)-robust machine scheduling with uncertain processing times
Cites work
- scientific article; zbMATH DE number 1149857 (Why is no real title available?)
- scientific article; zbMATH DE number 3231692 (Why is no real title available?)
- 10.1162/153244303321897726
- A Stochastic Optimization Algorithm Minimizing Expected Flow Times on Uniforn Processors
- A distributionally robust joint chance constrained optimization model for the dynamic network design problem under demand uncertainty
- A family of inequalities valid for the robust single machine scheduling polyhedron
- A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data
- A robust algorithm for semidefinite programming
- Algorithms and complexity analysis for robust single-machine scheduling problems
- An approximation algorithm for interval data minmax regret combinatorial optimization problems
- Complexity of minimizing the total flow time with interval data and minmax regret criterion
- Complexity of single machine scheduling problems under scenario-based uncertainty
- Distributionally robust optimization under moment uncertainty with application to data-driven problems
- Distributionally robust workforce scheduling in call centres with uncertain arrival rates
- Dynamic scheduling of stochastic jobs on a single machine
- Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion
- Minimizing the expected number of tardy jobs when processing times are normally distributed
- Minimizing the number of late jobs in a stochastic setting using a chance constraint
- Minimizing the number of tardy jobs with stochastically-ordered processing times
- Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem
- On the robust single machine scheduling problem
- Recent advances in robust optimization: an overview
- Robust Mean-Covariance Solutions for Stochastic Optimization
- Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
- Robust optimization
- Robust ranking and portfolio optimization
- Robust scheduling on a single machine to minimize total flow time
- Robustness to dependency in portfolio optimization using overlapping marginals
- Scheduling. Theory, algorithms, and systems.
- Stochastic Machine Scheduling with Precedence Constraints
- Stochastic scheduling to minimize expected maximum lateness
- Stochastic single machine scheduling with an exponentially distributed due date
- The minimax approach to stochastic programming and an illustrative application
- The single-machine total tardiness scheduling problem: review and extensions
- Worst-case conditional value-at-risk with application to robust portfolio management
- Worst-case distribution analysis of stochastic programs
Cited in
(25)- Minimizing value-at-risk in single-machine scheduling
- Distributionally robust scheduling on parallel machines under moment uncertainty
- Target-oriented robust satisficing models for the single machine scheduling problems with release time
- Single machine scheduling with release dates: a distributionally robust approach
- Robust single machine makespan scheduling with release date uncertainty
- Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms
- Distributionally robust single machine scheduling with the total tardiness criterion
- A distributionally robust approach for the two-machine permutation flow shop scheduling
- 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
- A stochastic approach for the single-machine scheduling problem to minimize total expected cost with client-dependent tardiness costs
- Carbon pricing initiatives-based bi-level pollution routing problem
- Risk-averse single machine scheduling: complexity and approximation
- Globalized distributionally robust optimization problems under the moment-based framework
- Coordination in a retailer‐dominated supply chain with a risk‐averse manufacturer under marketing dependency
- Distributionally robust fixed interval scheduling on parallel identical machines under uncertain finishing times
- Aversion scheduling in the presence of risky jobs
- Conditional value‐at‐risk beyond finance: a survey
- Accelerating the calculation of makespan used in scheduling improvement heuristics
- Distributionally Robust Optimization Under a Decision-Dependent Ambiguity Set with Applications to Machine Scheduling and Humanitarian Logistics
- The distributionally robust machine scheduling problem with job selection and sequence-dependent setup times
- Optimal chance-constrained pension fund management through dynamic stochastic control
- Evaluation of the quantiles and superquantiles of the makespan in interval valued activity networks
- Target-based distributionally robust optimization for single machine scheduling
- Quality competition and coordination in a VMI supply chain with two risk-averse manufacturers
- Optimization and coordination in a service-constrained supply chain with the bidirectional option contract under conditional value-at-risk
This page was built for publication: Distributionally robust single machine scheduling with risk aversion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1752194)
