Minimizing total weighted flow time under uncertainty using dominance and a stability box

Computers and Operations Research

Volumn 39, Issue 6, 2012, Pages 1271-1289

  Sotskov, Yu N ^a   Lai, T C ^b  

^a UNITED INSTITUTE OF INFORMATICS PROBLEMS   (Belarus)

^b NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

Interval input data; Single machine scheduling; Stability analysis; Total weighted flow time

Indexed keywords

A-STABILITY; EXACT FORMULAS; FLOW-TIME; INPUT DATAS; MINIMAL DOMINANT SET; PROCESSING TIME; REAL VALUES; SINGLE-MACHINE SCHEDULING; STABILITY ANALYSIS; STABILITY MEASURE;

ALGORITHMS; DATA PROCESSING; MACHINERY;

STABILITY;

EID: 80052587835     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2011.02.001     Document Type: Conference Paper

References (25)

1. M. Pinedo Scheduling: theory, algorithms, and systems 2nd ed 2002 Prentice-Hall USA, New Jersey
2. I. Averbakh Minmax regret solutions for minmax optimization problems with uncertainty Operations Research Letters 27 2000 57 65
3. RL. Daniels, and P. Kouvelis Robust scheduling to hedge against processing time uncertainty in single-stage production Management Science 41 2 1995 363 376
4. P. Kouvelis, and G. Yu Robust discrete optimization and its applications 1997 Kluwer Academic Publishers USA, Boston
5. 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)
6. M. Sevaux, and K. Sorensen A genetic algorithm for robust schedules in a one-machine environment with ready times and due dates 4OR: Quarterly Journal of the Belgian, French and Italian Operations Research Societies 2 2 2004 129 147
7. J. Yang, and G. Yu On the robust single machine scheduling problem Journal of Combinatorial Optimization 6 2002 17 33 (Pubitemid 34130061)
8. A. Kasperski, and P. Zielinski A 2-approximation algorithm for interval data minmax regret sequencing problems with total flow time criterion Operations Research Letters 36 2008 343 344
9. R. Montemanni A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data Journal of Mathematical Models and Algorithms 6 2007 287 296
10. T.-C. Lai, Y.N. Sotskov, N.Y. Sotskova, and F. Werner Optimal makespan scheduling with given bounds of processing times Mathematical and Computer Modelling 26 1997 67 86 (Pubitemid 27439728)
11. T.-C. Lai, and Y.N. Sotskov Sequencing with uncertain numerical data for makespan minimization Journal of the Operational Research Society 50 1999 230 243
12. Y.N. Sotskov, N.Y. Sotskova, T.-C. Lai, and F. Werner Scheduling under uncertainty. Theory and algorithms 2010 Belorusskaya nauka Belarus, Minsk
13. N.M. Matsveichuk, Y.N. Sotskov, N.G. Egorova, and T.-C. Lai Schedule execution for two-machine flow-shop with interval processing times Mathematical and Computer Modelling 49 56 2009 991 1011
14. Y.N. Sotskov, N.G. Egorova, and T.-C. Lai Minimizing total weighted flow time of a set of jobs with interval processing times Mathematical and Computer Modelling 50 2009 556 573
15. R.L. Graham, E.L. Lawler, J.K. Lenstra, and A.H.G Rinnooy Kan Optimization and approximation in deterministic sequencing and scheduling. A survey Annals of Discrete Mathematics 5 1976 287 326
16. WE. Smith Various optimizers for single-stage production Naval Research Logistics Quarterly 3 1 1956 59 66
17. R. Leus, and W. Herroelen The complexity of machine scheduling for stability with a single disrupted job Operations Research Letters 33 2005 151 156
18. R. Leus, and W. Herroelen Scheduling for stability in single-machine production systems Journal of Scheduling 10 2007 223 235 (Pubitemid 46866612)
19. 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)
20. A. Kasperski Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion Operations Research Letters 33 2005 431 436 (Pubitemid 40339644)
21. I. Averbakh The minmax regret permutation flow-shop problem with two jobs European Journal of Operational Research 169 2006 761 766 (Pubitemid 41492014)
22. T.-C. Lai, Y.N. Sotskov, N. Sotskova, and F. Werner Mean flow time minimization with given bounds of processing times European Journal of Operational Research 159 3 2004 558 573
23. Y.N. Sotskov, A. Allahverdi, and T-C. Lai Flowshop scheduling problem to minimize total completion time with random and bounded processing times Journal of the Operational Research Society 55 2004 277 286
24. Koffman EG, editor. Computer and job-shop scheduling theory. John Wiley & Sons; 1976.
25. Y.N. Sotskov, A.P.M. Wagelmans, and F. Werner On the calculation of the stability radius of an optimal or an approximate schedule Annals of Operations Research 83 1998 213 252