Single machine scheduling problems with uncertain parameters and the OWA criterion

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

Exact algorithms for OWA-optimization in multiobjective spanning tree problems

(2011) Lucie Galand et al.   COMPUTERS & OPERATIONS RESEARCH

Possibilistic Minmax Regret Sequencing Problems With Fuzzy Parameters

(2011) Adam Kasperski et al.   IEEE TRANSACTIONS ON FUZZY SYSTEMS

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

(2010) Hassene Aissi et al.   JOURNAL OF SCHEDULING

Improved polynomial algorithms for robust bottleneck problems with interval data

(2009) A. Volgenant et al.   COMPUTERS & OPERATIONS RESEARCH

A family of inequalities valid for the robust single machine scheduling polyhedron

(2009) Ismael Regis de Farias et al.   COMPUTERS & OPERATIONS RESEARCH

Complexity of single machine scheduling problems under scenario-based uncertainty

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