Approximating a two-machine flow shop scheduling under discrete scenario uncertainty

European Journal of Operational Research

Volumn 217, Issue 1, 2012, Pages 36-43

  Kasperski, Adam ^a   Kurpisz, Adam ^a   Zieliński, Paweł ^a  

^a WROCLAW UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Approximation; Combinatorial optimization; Flow shop; Robust optimization; Scheduling

Indexed keywords

APPROXIMATION; FLOW-SHOP SCHEDULING; FLOW-SHOPS; JOB PROCESSING TIME; MIN-MAX; MINMAX REGRET; NP-HARD; PERFORMANCE RATIO; PERMUTATION FLOW SHOPS; POLYNOMIAL TIME APPROXIMATION SCHEMES; PROCESSING TIME; ROBUST OPTIMIZATION; STRONGLY NP-HARD; TWO MACHINES; UNCERTAIN DATAS; UNCERTAINTY REPRESENTATION;

COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; OPTIMIZATION; POLYNOMIAL APPROXIMATION; SCHEDULING;

MACHINE SHOP PRACTICE;

EID: 80054947273     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2011.08.029     Document Type: Article

References (30)

1. S.M. Johnson Optimal two- and three-stage production with setup times included Naval Research Logistic Quarterly 1 1954 61 68
2. M.R. Garey, D.S. Johnson, and R. Sethi The complexity of flowshop and jobshop scheduling Mathematics of Operations Research 1 1976 117 129
3. B. Roy Robustness in operational research and decision aiding: A multi-faceted issue European Journal of Operational Research 200 2010 629 638
4. R.D. Luce, and H. Raiffa Games and Decisions: Introduction and Critical Survey 1957 Dover Publications Inc.
5. P. Kouvelis, and G. Yu Robust Discrete Optimization and its applications 1997 Kluwer Academic Publishers
6. G. Yu, and J. Yang On the robust shortest path problem Computers and Operations Research 6 1998 457 468
7. I. Averbakh On the complexity of a class of combinatorial optimization problems with uncertainty Mathematical Programming 90 2001 263 272 (Pubitemid 33758924)
8. I. Averbakh, and V. Lebedev Interval data minmax regret network optimization problems Discrete Applied Mathematics 138 2004 289 301
9. A. Kasperski, and P. Zieliński On the approximability of minmax (regret) network optimization problems Information Processing Letters 109 2009 262 266
10. A. Kasperski, and P. Zieliński On the approximability of robust spanning tree problems Theoretical Computer Science 412 2011 365 374
11. H. Aissi, C. Bazgan, and D. Vanderpooten Min-max and min-max regret versions of combinatorial optimization problems: A survey European Journal of Operational Research 197 2009 427 438
12. P. Kouvelis, R.L. Daniels, and G. Vairaktarakis Robust scheduling of a two-machine flow shop with uncertain processing times IIE Transactions 32 2000 421 432 (Pubitemid 30540764)
13. I. Averbakh The minmax regret permutation flow-shop problem with two jobs European Journal of Operational Research 169 2006 761 766 (Pubitemid 41492014)
14. M.A. Alouloua, and F.D. Croce Complexity of single machine scheduling problems under scenario-based uncertainty Operation Research Letters 36 2008 338 342
15. R.L. Daniels, and P. Kouvelis Robust scheduling to hedge against processing time uncertainty in single stage production Management Science 41 1995 363 376
16. A. Kasperski Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion Operation Research Letters 33 4 2005 431 436 (Pubitemid 40339644)
17. A. Kasperski, and P. Zieliński A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion Operation Research Letters 36 2008 343 344
18. V. Lebedev, and I. Averbakh Complexity of minimizing the total flow time with interval data and minmax regret criterion Discrete Applied Mathematics 154 2006 2167 2177 (Pubitemid 44209193)
19. R. Montemanni A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data Journal of Mathematical Modelling and Algorithms 6 2 2007 287 296
20. M. Mastrolilli, N. Mutsanas, and O. Svensson Approximating Single Machine Scheduling with Scenarios APPROX-RANDOM 2008, Lecture Notes in Computer Science vol. 5171 2008 Springer-Verlag 153 164
21. J. Yang, and G. Yu On the robust single machine scheduling problem Journal of Combinatorial Optimization 6 2002 17 33 (Pubitemid 34130061)
22. H. Aissi, C. Bazgan, and D. Vanderpooten General approximation schemes for minmax (regret) versions of some (pseudo-)polynomial problems Discrete Optimization 7 2010 136 148
23. P. Brucker Scheduling Algorithms fifth ed. 2007 Springer Verlag Heidelberg
24. R. Garey, and D.S. Johnson Computers and Intractability A Guide to the Theory of NP-Completeness 1979 W.H. Freeman and Company
25. K. Jansen, R. Solis-Oba, and M. Sviridenko Makespan minimization in job shops: A linear time approximation scheme SIAM Journal on Discrete Mathematics 16 2003 288 300
26. C.N. Potts Analysis of a linear-programming heuristic for scheduling unrelated parallel machines Discrete Applied Mathematics 10 1985 155 164
27. L.A. Hall Approximability of flow shop scheduling Mathematical Programming 82 1998 175 190 (Pubitemid 128401586)
28. S.V. Sevastianov, and G.J. Woeginger Makespan minimization in open shops: A polynomial time approximation scheme Mathematical Programming 82 1998 191 198 (Pubitemid 128401587)
29. S.V. Sevastianov Vector summation in banach space and polynomial time algorithms for flow shops and open shops Mathematics of Operations Research 20 1995 90 103
30. L.A. Hall, Approximation Algorithms for Scheduling, in: D. Hochbaum (Ed.), Approximation Algorithms for NP-Hard Problems, PWS, 1995, pp. 1-43.