Risk-averse single machine scheduling: complexity and approximation

Distributionally robust single machine scheduling with risk aversion

(2017) Zhiqi Chang et al.   EUROPEAN JOURNAL OF OPERATIONAL RESEARCH

A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems

(2017) Maurice Cheung et al.   SIAM JOURNAL ON DISCRETE MATHEMATICS

Minimizing value-at-risk in single-machine scheduling

(2016) Semih Atakan et al.   ANNALS OF OPERATIONS RESEARCH

Unrelated Machine Scheduling with Stochastic Processing Times

(2016) Martin Skutella et al.   MATHEMATICS OF OPERATIONS RESEARCH

Complexity of interval minmax regret scheduling on parallel identical machines with total completion time criterion

(2016) Maciej Drwal et al.   OPERATIONS RESEARCH LETTERS

Lawler’s minmax cost algorithm: optimality conditions and uncertainty

(2015) Nadia Brauner et al.   JOURNAL OF SCHEDULING

Single machine scheduling problems with uncertain parameters and the OWA criterion

(2015) Adam Kasperski et al.   JOURNAL OF SCHEDULING

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

(2013) Subhash C. Sarin et al.   JOURNAL OF SCHEDULING

A Probabilistic Model for Minmax Regret in Combinatorial Optimization

(2013) Karthik Natarajan et al.   OPERATIONS RESEARCH

Single machine scheduling with scenarios

(2013) Monaldo Mastrolilli et al.   THEORETICAL COMPUTER SCIENCE

Approximating the min–max (regret) selecting items problem

(2012) Adam Kasperski et al.   INFORMATION PROCESSING LETTERS

Minimizing the number of late jobs on a single machine under due date uncertainty

(2010) Hassene Aissi et al.   JOURNAL OF SCHEDULING

Min–max and min–max regret versions of combinatorial optimization problems: A survey

(2008) Hassene Aissi et al.   EUROPEAN JOURNAL OF OPERATIONAL RESEARCH

Complexity of single machine scheduling problems under scenario-based uncertainty

(2007) Mohamed Ali Aloulou et al.   OPERATIONS RESEARCH LETTERS