Minimizing conditional-value-at-risk for stochastic scheduling problems
From MaRDI portal
Publication:398891
DOI10.1007/S10951-013-0349-6zbMATH Open1297.90067OpenAlexW2002203564MaRDI QIDQ398891FDOQ398891
Authors: Hanif D. Sherali, Lingrui Liao, Subhash C. Sarin 
Publication date: 18 August 2014
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-013-0349-6
Recommendations
- Minimizing value-at-risk in single-machine scheduling
- Bounds on optimal values in stochastic scheduling
- Conditional value-at-risk in stochastic programs with mixed-integer recourse
- scientific article; zbMATH DE number 1060044
- As soon as probable: optimal scheduling under stochastic uncertainty
- Minimizing earliness and tardiness costs in stochastic scheduling
- Scenario reduction for stochastic programs with conditional value-at-risk
- Optimal stochastic scheduling
dynamic programmingBenders decompositiontotal weighted tardinessstochastic schedulingconditional-value-at-risk
Cites Work
- Coherent measures of risk
- Partitioning procedures for solving mixed-variables programming problems
- On generating maximal nondominated Benders cuts
- A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
- Dual Stochastic Dominance and Related Mean-Risk Models
- Introduction to Stochastic Programming
- Sample average approximation of expected value constrained stochastic programs
- New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints
- Rescheduling manufacturing systems: A framework of strategies, policies, and methods
- An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem
- Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
- Analysis of reactive scheduling problems in a job shop environment
- An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem
- Title not available (Why is that?)
- Stochastic Machine Scheduling with Precedence Constraints
Cited In (17)
- Bridging \(k\)-sum and CVaR optimization in MILP
- Exact algorithms for distributionally \(\beta \)-robust machine scheduling with uncertain processing times
- Minimizing value-at-risk in single-machine scheduling
- A stochastic bi-objective project scheduling model under failure of activities
- 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
- Decomposition algorithms for optimizing multi-server appointment scheduling with chance constraints
- Optimization of discrete broadcast under uncertainty using conditional value-at-risk
- Risk-averse single machine scheduling: complexity and approximation
- Conditional value‐at‐risk beyond finance: a survey
- Expected shortfall: heuristics and certificates
- Scenario cluster Lagrangean decomposition for risk averse in multistage stochastic optimization
- Optimizing makespan and stability risks in job shop scheduling
- The distributionally robust machine scheduling problem with job selection and sequence-dependent setup times
- Mixed integer linear programming models for optimal crop selection
- Evaluation of the quantiles and superquantiles of the makespan in interval valued activity networks
- Target-based distributionally robust optimization for single machine scheduling
- Risk averse scheduling with scenarios
Uses Software
This page was built for publication: Minimizing conditional-value-at-risk for stochastic scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q398891)
