Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1142813 | Operations Research Letters | 2008 | 5 Pages |
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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Mohamed Ali Aloulou, Federico Della Croce,