Minimizing value-at-risk in single-machine scheduling
From MaRDI portal
Recommendations
- Risk-averse single machine scheduling: complexity and approximation
- Risk averse scheduling with scenarios
- Distributionally robust single machine scheduling with risk aversion
- Single machine scheduling under market uncertainty
- Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
Cites work
- scientific article; zbMATH DE number 5547872 (Why is no real title available?)
- scientific article; zbMATH DE number 3550182 (Why is no real title available?)
- scientific article; zbMATH DE number 1271322 (Why is no real title available?)
- scientific article; zbMATH DE number 1312984 (Why is no real title available?)
- scientific article; zbMATH DE number 1836444 (Why is no real title available?)
- scientific article; zbMATH DE number 772850 (Why is no real title available?)
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- A Stochastic Programming Model
- A decomposition algorithm for the single machine total tardiness problem
- A difference of convex formulation of value-at-risk constrained optimization
- A family of inequalities valid for the robust single machine scheduling polyhedron
- A hybrid algorithm for the one machine sequencing problem to minimize total tardiness
- A note on a new variant of Murty's ranking assignments algorithm
- About Lagrangian methods in integer optimization
- Algorithms for stochastic mixed-integer programming models
- An exact algorithm for single-machine scheduling without machine idle time
- Approximating a two-machine flow shop scheduling under discrete scenario uncertainty
- Assignment Problems
- Coherent measures of risk
- Complexity of single machine scheduling problems under scenario-based uncertainty
- Conditional value-at-risk in stochastic programs with mixed-integer recourse
- Convexity and decomposition of mean-risk stochastic programs
- Disregarding Duration Uncertainty in Partial Order Schedules? Yes, We Can!
- Dual Stochastic Dominance and Related Mean-Risk Models
- Dual decomposition in stochastic integer programming
- External risk measures and Basel accords
- Introduction to Stochastic Programming
- L-shaped decomposition of two-stage stochastic programs with integer recourse
- Lagrangian duality applied to the vehicle routing problem with time windows
- Lectures on Stochastic Programming
- Minimizing Total Tardiness on One Machine is NP-Hard
- Minimizing conditional-value-at-risk for stochastic scheduling problems
- Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion
- Minimizing the number of late jobs in a stochastic setting using a chance constraint
- Modeling, measuring and managing risk
- On a stochastic sequencing and scheduling problem
- On the choice of explicit stabilizing terms in column generation
- On the global minimization of the value-at-risk
- On the robust single machine scheduling problem
- Optimal stochastic single-machine-tardiness scheduling by stochastic branch-and-bound
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Optimization models with probabilistic constraints
- Reducibility among combinatorial problems
- Risk Aversion via Excess Probabilities in Stochastic Programs with Mixed-Integer Recourse
- Risk-averse two-stage stochastic programming with an application to disaster management
- Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
- Robust scheduling on a single machine to minimize total flow time
- Robustness and sensitivity analysis of risk measurement procedures
- Scenarios and Policy Aggregation in Optimization Under Uncertainty
- Scheduling
- Scheduling with uncertain durations: Modeling \(\beta \)-robust scheduling with constraints
- Stochastic integer programming: general models and algorithms
- The B<scp>oxstep</scp> Method for Large-Scale Optimization
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- Two‐stage stochastic integer programming: a survey
- Value-at-risk optimization using the difference of convex algorithm
Cited in
(14)- Risk averse scheduling with scenarios
- Parallel branch-and-price algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setup times
- 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
- Distributionally robust single machine scheduling with risk aversion
- Minimizing conditional-value-at-risk for stochastic scheduling problems
- A stochastic approach for the single-machine scheduling problem to minimize total expected cost with client-dependent tardiness costs
- Risk-averse single machine scheduling: complexity and approximation
- 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
- Research on construction and application for the model of multistage job shop scheduling problem
- Evaluation of the quantiles and superquantiles of the makespan in interval valued activity networks
- Target-based distributionally robust optimization for single machine scheduling
- Stochastic planning and scheduling with logic-based Benders decomposition
This page was built for publication: Minimizing value-at-risk in single-machine scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q513548)
