Minimizing total weighted flow time of a set of jobs with interval processing times

Mathematical and Computer Modelling

Volumn 50, Issue 3-4, 2009, Pages 556-573

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

^a UNITED INSTITUTE OF INFORMATICS PROBLEMS   (Belarus)

^b NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

Domination; Single machine scheduling; Uncertainty

Indexed keywords

COMPUTATIONAL EXPERIMENT; DOMINANCE RELATION; DOMINATION; EXTREME CASE; FLOW-TIME; HEURISTIC PROCEDURES; POLYNOMIAL-TIME; PROCESSING TIME; REAL VALUES; SCHEDULING PROBLEM; SINGLE-MACHINE SCHEDULING; SUFFICIENT CONDITIONS; UNCERTAIN PROCESSING; UNCERTAIN PROCESSING TIME; UNCERTAINTY;

HEURISTIC METHODS; MACHINERY; OPTIMIZATION; POLYNOMIAL APPROXIMATION; TRAJECTORIES;

SCHEDULING;

EID: 67549111939     PISSN: 08957177     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.mcm.2009.03.006     Document Type: Article

References (25)

1. Pinedo M. Scheduling: Theory, Algorithms, and Systems (1995), Prentice-Hall, USA, Englewood Cliffs
2. Aytug H., Lawley M.A., McKay K., Mohan S., and Uzsoy R. Executing production schedules in the face of uncertainties: A review and some future directions. European Journal of Operational Research 161 (2005) 86-110
3. Barbagallo A. Regularity results for time-dependent variational and quasi-variational inequalities and application to the calculation of dynamic traffic network. Mathematical Models and Methods in Applied Sciences 17 2 (2007) 277-304
4. Lai T.-C., Sotskov Yu.N., Sotskova N., and Werner F. Optimal makespan scheduling with given bounds of processing times. Mathematical and Computer Modelling 26 (1997) 67-86
5. Lai T.-C., and Sotskov Yu.N. Sequencing with uncertain numerical data for makespan minimization. Journal of the Operational Research Society 50 (1999) 230-243
6. Sevaux M., and Sorensen K. A genetic algorithm for robust schedules in a one-machine environment with ready times and due dates. 4OR A Quarterly Journal of Operations Research 2 2 (2004) 129-147
7. Averbakh I. Minmax regret solutions for minmax optimization problems with uncertainty. Operations Research Letters 27 (2000) 57-65
8. Daniels R.L., and Kouvelis P. Robust scheduling to hedge against processing time uncertainty in single-stage production. Management Science 41 2 (1995) 363-376
9. Kouvelis P., and Yu G. Robust Discrete Optimization and Its Applications (1997), Kluwer Academic Publishers, Boston, The USA
10. Lebedev V., and Averbakh I. Complexity of minimizing the total flow time with interval data and minmax regret criterion. Discrete Applied Mathematics 154 (2006) 2167-2177
11. Yang J., and Yu G. On the robust single machine scheduling problem. Journal of Combinatorial Optimization 6 (2002) 17-33
12. Graham R.L., Lawler E.L., Lenstra J.K., and Rinnooy Kan A.H.G. Optimization and approximation in deterministic sequencing and scheduling. A survey. Annals of Discrete Mathematics 5 (1976) 287-326
13. Smith W.E. Various optimizers for single-stage production. Naval Research and Logistics Quarterly 3 1 (1956) 59-66
14. Averbakh I. On the complexity of a class of combinatorial optimization problems with uncertainty. Mathematical Programming, Series A 90 (2001) 263-272
15. Leus R., and Herroelen W. The complexity of machine scheduling for stability with a single disrupted job. Operations Research Letters 33 (2005) 151-156
16. Leus R., and Herroelen W. Scheduling for stability in single-machine production systems. Journal of Scheduling 10 (2007) 223-235
17. Kouvelis P., Daniels R.L., and Vairaktarakis G. Robust scheduling of a two-machine flow shop with uncertain processing times. IIE Transactions 32 (2000) 421-432
18. Kasperski A. Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion. Operations Research Letters 33 (2005) 431-436
19. Allahverdi A., and Sotskov Yu.N. Two-machine flowshop minimum-length scheduling problem with random and bounded processing times. International Transactions in Operational Research 10 (2003) 65-76
20. Allahverdi A., Aldowaisan T., and Sotskov Yu.N. Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times. International Journal of Mathematical Sciences 39 (2003) 2475-2486
21. Leshchenko N.M., and Sotskov Yu.N. Realization of an optimal schedule for the two-machine flow-shop with interval processing times. International Journal Information Theories & Applications 14 (2007) 182-189
22. Sotskov Yu.N., Allahverdi A., and Lai T.-C. Flowshop scheduling problem to minimize total completion time with random and bounded processing times. Journal of the Operational Research Society 55 (2004) 277-286
23. In: Koffman E.G. (Ed). Computer and Job-Shop Scheduling Theory (1976), John Wiley & Sons
24. Taillard E. Benchmarks for basic scheduling problems. European Journal of Operational Research 64 (1993) 278-285
25. Matsveichuk N.M., Sotskov Yu.N., Egorova N.G., and Lai T.-C. Schedule execution for two-machine flow-shop with interval processing times. Mathematical and Computer Modelling 49 5-6 (2009) 991-1011