Complexity of single machine scheduling problems under scenario-based uncertainty

Operations Research Letters

Volumn 36, Issue 3, 2008, Pages 338-342

  Aloulou, Mohamed Ali ^a   Della Croce, Federico ^b  

^a UNIVERSITÉ PARIS DAUPHINE   (France)

^b POLITECNICO DI TORINO   (Italy)

Author keywords

Absolute robustness; Scenario based uncertainty; Scheduling

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; PROBLEM SOLVING; ROBUSTNESS (CONTROL SYSTEMS);

ABSOLUTE ROBUSTNESS; SCENARIO-BASED UNCERTAINTY;

SCHEDULING;

EID: 43049084777     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2007.11.005     Document Type: Article

References (10)

1. I. Averbakh Minmax regret solutions for minimax optimization problems with uncertainty Operations Research Letters 27 2000 57 65
2. R.L. Daniels P. Kouvelis Robust scheduling to hedge against processing time uncertainty in single stage production Management Science 41 1995 363 376
3. M.R. Garey D.S. Johnson Computers and Intractability: A Guide to the Theory of NP-Completeness 1979 W. H. Freeman
4. R.L. Graham E.L. Lawler J.K. Lenstra A.H.G. Rinnooy Kan Optimization and approximation in deterministic machine scheduling: A survey Annals of Discrete Mathematics 5 1979 287 326
5. A. Kasperski Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion Operations Research Letters 33 2005 431 436
6. P. Kouvelis R.L. Daniels G. Vairaktarakis Robust scheduling of a two-machine flow shop with uncertain processing times IIE Transactions 32 2000 421 432
7. P. Kouvelis G. Yu Robust Discrete Optimisation and its Applications 1997 Kluwer Academic Publisher
8. E.L. Lawler Optimal sequencing of a single machine subject to precedence constraints Management Science 19 1973 544 546
9. A n job, one machine sequencing algorithm for minimizing the number of late jobs
10. J. Yang G. Yu On the robust single machine scheduling problem Journal of Combinatorial Optimization 6 2002 17 33