Complexity of single machine scheduling problems under scenario-based uncertainty

Della Croce, Federico; Aloulou, Mohamed Ali

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

2008

Journal name

Operations Research Letters

Volume

Number

Publisher

Elsevier

Pages

338-342

Abstract (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 robustness