Schedule execution for two-machine flow-shop with interval processing times

Mathematical and Computer Modelling

Volumn 49, Issue 5-6, 2009, Pages 991-1011

  Matsveichuk, N M ^a   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

Dominant schedule; Flow shop; Makespan; Scheduling; Uncertainty

Indexed keywords

PROCESS ENGINEERING; TRAJECTORIES;

COMPUTATIONAL EXPERIMENTS; DOMINANT SCHEDULE; DOMINANT SETS; EXECUTION PHASE; FLOW-SHOP; FLOW-SHOP SCHEDULING PROBLEMS; LOCAL INFORMATIONS; LOWER AND UPPER BOUNDS; MAKESPAN; ON-LINE SCHEDULING; PLANNING PHASE; PROCESSING TIME; SCHEDULING DECISIONS; SCHEDULING PROCESS; SUFFICIENT CONDITIONS; UNCERTAIN PROCESSING; UNCERTAIN PROCESSING TIME; UNCERTAINTY;

SCHEDULING;

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

References (27)

1. Pinedo M. Scheduling: Theory, Algorithms, and Systems (1995), Prentice-Hall, Englewood Cliffs, USA
2. Elmaghraby S., and Thoney K.A. Two-machine flowshop problem with arbitrary processing time distributions. IIE Transactions 31 (2000) 467-477
3. Kamburowski J. Stochastically minimizing the makespan in two-machine flow shops without blocking. European Journal of Operational Research 112 (1999) 304-309
4. Ku P.S., and Niu S.C. On Johnson's two-machine flow-shop with random processing times. Operations Research 34 (1986) 130-136
5. Portougal V., and Trietsch D. Johnson's problem with stochastic processing times and optimal service level. European Journal of Operational Research 169 (2006) 751-760
6. Allahverdi A. Stochastically minimizing total flowtime in flowshops with no waiting space. European Journal of Operational Research 113 (1999) 101-112
7. Allahverdi A., and Mittenthal J. Two-machine ordered flowshop scheduling under random breakdowns. Mathematical and Computer Modelling 20 (1994) 9-17
8. 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
9. 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 (1979) 287-326
10. Jansen K., Mastrolilli V., and Solis-Oba R. Approximation schemes for job shop scheduling problems with controllable processing times. European Journal of Operational Research 167 (2005) 297-319
11. Janiak A. General flow-shop scheduling with resource constraints. International Journal of Production Research 26 (1988) 125-138
12. Ng C.T., Cheng T.C.E., and Kovalyov M.Y. Single machine batch scheduling with jointly compressible setup and processing times. European Journal of Operational Research 153 (2004) 211-219
13. Cheng T.C.E., Kovalyov M.Y., and Shakhlevich N.V. Scheduling with controllable release dates and processing times: Makespan minimization. European Journal of Operational Research 175 (2006) 751-768
14. 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
15. N.M. Leshchenko, Yu.N. Sotskov, Two-machine minimum-length shop-scheduling problems with uncertain processing times, in: Proceedings of XI-th International Conference "Knowledge-Dialogue-Solution", vol. 2, Varna, Bulgaria, June 20-0, 2005 pp. 375-381
16. Lai T.-C., Sotskov Yu.N., Sotskova N., and Werner F. Mean flow time minimization with given bounds of processing times. European Journal of Operational Research 159 (2004) 558-573
17. 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
18. 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
19. 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
20. Leshchenko N.M., and Sotskov Yu.N. Realization of an optimal schedule for the two-machine flow-shop with interval job processing times. International Journal "Information Theories and Applications" 14 2 (2007) 182-189
21. Johnson S.M. Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly 1 (1954) 61-68
22. Taillard E. Benchmarks for basic scheduling problems. European Journal of Operational Research 64 (1993) 278-285
23. 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
24. Wu S.D., Byeon E.-S., and Storer R. A graph-theoretical decomposition of the job-shop scheduling problem to achieve scheduling robustness. Operations Research 47 1 (1999) 113-124
25. 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
26. Averbakh I. Minmax regret solutions for minmax optimization problems with uncertainty. Operations Research Letters 27 (2000) 57-65
27. 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