Name
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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.orl.2007.11.005 | Oper. Res. Lett. |
Keywords | DocType | Volume |
scheduling,so-called absolute robustness,present algorithmic,absolute robustness.,Scheduling,scenario-based uncertainty,Absolute robustness,single machine scheduling problem,well-defined scenario,finite set,computational complexity result,feasible solution,job characteristic,Scenario-based uncertainty | Journal | 36 |
Issue | ISSN | Citations |
3 | Operations Research Letters | 29 |
PageRank | References | Authors |
1.28 | 4 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mohamed Ali Aloulou | 1 | 102 | 8.31 |
| Federico Della Croce | 2 | 399 | 41.60 |