Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion

Operations Research Letters

Volumn 33, Issue 4, 2005, Pages 431-436

  Kasperski, Adam ^a  

^a WROCLAW UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Maximal regret; Robust optimization; Sequencing

Indexed keywords

ALGORITHMS; DATA ACQUISITION; JOB ANALYSIS; MATHEMATICAL MODELS; OPTIMIZATION; POLYNOMIAL APPROXIMATION; PROBABILITY; PROBLEM SOLVING; ROBUSTNESS (CONTROL SYSTEMS); SET THEORY;

MAXIMAL REGRET; REAL-WORLD PROCESSES; ROBUST OPTIMIZATION; SINGLE MACHINE SEQUENCING PROBLEM;

SEQUENTIAL MACHINES;

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

References (7)

1. I. Averbakh Minmax regret solutions for minimax optimization problems with uncertainty Oper. Res. Lett. 27 2000 57 65
2. P. Brucker Scheduling Algorithms, Second Revised and Enlarged Edition 1998 Springer Berlin
3. R.L. Daniels, and P. Kouvelis Robust scheduling to hedge against processing time uncertainty in single-stage production Management Sci. 41 2 1995 363 376
4. P. Kouvelis, R.L. Daniels, G. Vairaktarakis, Robust scheduling of a two-machine flow shop with uncertain processing times, Working Paper, Fuqua School of Business, Duke University, 1996.
5. P. Kouvelis, and G. Yu Robust Discrete Optimization and its Applications 1997 Kluwer Academic Publishers Boston
6. E.L. Lawler Optimal sequencing of a single machine subject to precedence constraints Management Sci. 19 1973 544 546
7. G. Yu, and P. Kouvelis Complexity results for a class of min-max problems with robust optimization applications P.M. Pardalos Complexity in Numerical Optimization 1993 World Scientific Singapore 501 511