Complexity of single machine scheduling problems under scenario-based uncertainty
Della Croce, Federico; Aloulou, Mohamed Ali (2008), Complexity of single machine scheduling problems under scenario-based uncertainty, Operations Research Letters, 36, 3, p. 338-342. http://dx.doi.org/10.1016/j.orl.2007.11.005
Type
Article accepté pour publication ou publiéDate
2008Journal name
Operations Research LettersVolume
36Number
3Publisher
Elsevier
Pages
338-342
Publication identifier
Metadata
Show full item recordAbstract (EN)
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.Subjects / Keywords
Scheduling; Scenario-based uncertainty; Absolute robustnessRelated items
Showing items related by title and author.
-
Della Croce, Federico; Aloulou, Mohamed Ali (2008) Chapitre d'ouvrage
-
Portmann, Marie-Claude; Kovalyov, Mikhail Y.; Aloulou, Mohamed Ali (2007) Article accepté pour publication ou publié
-
Aissi, Hassene; Aloulou, Mohamed Ali; Kovalyov, Mikhail Y. (2011) Article accepté pour publication ou publié
-
Aloulou, Mohamed Ali; Kovalyov, Mikhail Y.; Portmann, Marie-Claude (2004) Article accepté pour publication ou publié
-
Aloulou, Mohamed Ali; Kovalyov, Mikhail Y.; Portmann, Marie-Claude (2003) Communication / Conférence