Minimizing conditional-value-at-risk for stochastic scheduling problems

DOI10.1007/s10951-013-0349-6zbMath1297.90067OpenAlexW2002203564MaRDI QIDQ398891

Lingrui Liao, Hanif D. Sherali, Sarin, Subhash C.

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

zbMATH Keywords

dynamic programmingstochastic schedulingBenders decompositiontotal weighted tardinessconditional-value-at-risk

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36) Dynamic programming (90C39)

Related Items

Decomposition algorithms for optimizing multi-server appointment scheduling with chance constraints, Mixed integer linear programming models for optimal crop selection, 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, Conditional value‐at‐risk beyond finance: a survey, Evaluation of the quantiles and superquantiles of the makespan in interval valued activity networks, Bridging \(k\)-sum and CVaR optimization in MILP, Exact Algorithms for Distributionally β-Robust Machine Scheduling with Uncertain Processing Times, Minimizing value-at-risk in single-machine scheduling, Expected shortfall: heuristics and certificates, Risk Averse Scheduling with Scenarios, Risk-averse single machine scheduling: complexity and approximation, Target-based distributionally robust optimization for single machine scheduling

Uses Software

• OR-Library
• XVA-Sched

Cites Work

• Unnamed Item
• Sample average approximation of expected value constrained stochastic programs
• Partitioning procedures for solving mixed-variables programming problems
• An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem
• New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints
• On generating maximal nondominated Benders cuts
• Rescheduling manufacturing systems: A framework of strategies, policies, and methods
• Coherent Measures of Risk
• An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem
• A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
• Introduction to Stochastic Programming
• Dual Stochastic Dominance and Related Mean-Risk Models
• Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
• Stochastic Machine Scheduling with Precedence Constraints
• Analysis of reactive scheduling problems in a job shop environment