Complexity of single machine scheduling problems under scenario-based uncertainty

Authors:
Mohamed Ali Aloulou;Federico Della Croce
Affiliations:
LAMSADE, Université Paris Dauphine, France;D.A.I., Politecnico di Torino, Italy
Venue:
Operations Research Letters
Year:
2008

Citing 4
Cited 1

Robust scheduling to hedge against processing time uncertainty in single-stage production

Management Science
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Minmax regret solutions for minimax optimization problems with uncertainty

Operations Research Letters
Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion

Operations Research Letters

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

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present algorithmic and computational complexity results for several single machine scheduling problems where some job characteristics are uncertain. This uncertainty is modeled through a finite set of well-defined scenarios. We use here the so-called absolute robustness criterion to select among feasible solutions.