Distributionally robust single machine scheduling with risk aversion
type: Item
instance of: scholarly article
title: Distributionally robust single machine scheduling with risk aversion
zbMATH Open document ID: 1394.90266
author: Zhiqi Chang
author: Yuli Zhang
author: Jian-Ya Ding
author: Rui Zhang
author: Raymond Chiong
author: Shiji Song
published in: European Journal of Operational Research
publication date: 2018-05-24T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B36
Mathematics Subject Classification ID: 91B30
zbMATH DE Number: 6872206
zbMATH Keywords: robustness and sensitivity analysis
zbMATH Keywords: distributionally robust optimization
zbMATH Keywords: single machine scheduling
zbMATH Keywords: CVaR
zbMATH Keywords: total flow time
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: j.ejor.2016.06.025
OpenAlex ID: W2429059420
cites work: A Stochastic Optimization Algorithm Minimizing Expected Flow Times on Uniforn Processors
cites work: Complexity of single machine scheduling problems under scenario-based uncertainty
cites work: Q3182207
cites work: Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
cites work: A family of inequalities valid for the robust single machine scheduling polyhedron
cites work: Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems
cites work: A robust algorithm for semidefinite programming
cites work: Robustness to dependency in portfolio optimization using overlapping marginals
cites work: The minimax approach to stochastic programming and an illustrative application
cites work: Recent advances in robust optimization: an overview
cites work: Dynamic scheduling of stochastic jobs on a single machine
cites work: Minimizing the expected number of tardy jobs when processing times are normally distributed
cites work: Stochastic single machine scheduling with an exponentially distributed due date
cites work: Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion
cites work: An approximation algorithm for interval data minmax regret combinatorial optimization problems
cites work: Q4387249
cites work: The single-machine total tardiness scheduling problem: review and extensions
cites work: Q5519710
cites work: 10.1162/153244303321897726
cites work: Complexity of minimizing the total flow time with interval data and minmax regret criterion
cites work: Distributionally robust workforce scheduling in call centres with uncertain arrival rates
cites work: Robust scheduling on a single machine to minimize total flow time
cites work: A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data
cites work: Robust ranking and portfolio optimization
cites work: Scheduling
cites work: Robust Mean-Covariance Solutions for Stochastic Optimization
cites work: Worst-case distribution analysis of stochastic programs
cites work: Stochastic Machine Scheduling with Precedence Constraints
cites work: Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem
cites work: A distributionally robust joint chance constrained optimization model for the dynamic network design problem under demand uncertainty
cites work: Algorithms and complexity analysis for robust single-machine scheduling problems
cites work: Minimizing the number of tardy jobs with stochastically-ordered processing times
cites work: Minimizing the number of late jobs in a stochastic setting using a chance constraint
cites work: Stochastic scheduling to minimize expected maximum lateness
cites work: On the robust single machine scheduling problem
cites work: Worst-Case Conditional Value-at-Risk with Application to Robust Portfolio Management
DOI: 10.1016/J.EJOR.2016.06.025
description: scientific article; zbMATH DE number 6872206