The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times

Optimization

Volumn 60, Issue 12, 2011, Pages 1493-1517

  Matsveichuk, N M ^a   Sotskov, Y N ^a   Werner, F ^b  

^a UNITED INSTITUTE OF INFORMATICS PROBLEMS   (Belarus)

^b OTTO VON GUERICKE UNIVERSITY   (Germany)

Author keywords

dominance relation; makespan; scheduling; uncertainty

Indexed keywords

EID: 84858145142     PISSN: 02331934     EISSN: 10294945     Source Type: Journal    
DOI: 10.1080/02331931003657691     Document Type: Article

References (19)

1. Allahverdi, A, Aldowaisan, T and Sotskov, YN. 2003. Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times. Int. J. Math. Sci., 39: 2475-2486.
2. Allahverdi, A and Sotskov, YN. 2003. Two-machine flowshop minimum-length scheduling problem with random and bounded processing times. Int. Trans. Oper. Res., 10: 65-76.
3. Aytug, H, Lawley, MA, McKay, K, Mohan, S and Uzsoy, R. 2005. Executing production schedules in the face of uncertainties: a review and some future directions. Euro. J. Oper. Res., 161: 86-110.
4. Briand, C, Trung La, H and Erschler, J. 2006. A new sufficient condition of optimality for the two-machine flowshop problem. Euro. J. Oper. Res., 169: 712-722.
5. Johnson, SM. 1954. Optimal two- and three-stage production schedules with setup times included. Naval Res. Logist. Quart., 1: 61-68.
6. Kouvelis, P, Daniels, RL and Vairaktarakis, G. 2000. Robust scheduling of a two-machine flow shop with uncertain processing times. IIE Trans., 32: 421-432.
7. Kouvelis, P and Yu, G. 1997. Robust Discrete Optimization and its Applications, Boston: Kluwer Academic Publishers.
8. Lai, T-C and Sotskov, YN. 1999. Sequencing with uncertain numerical data for makespan minimization. J. Oper. Res. Soc., 50: 230-243.
9. Lai, T-C, Sotskov, YN, Sotskova, N and Werner, F. 1997. Optimal makespan scheduling with given bounds of processing times. Math. Comput. Model., 26: 67-86.
10. Lai, T-C, Sotskov, YN, Sotskova, N and Werner, F. 2004. Mean flow time minimization with given bounds of processing times. Euro. J. Oper. Res., 159: 558-573.
11. N.M. Leshchenko and Y.N. Sotskov, Two-machine minimum-length shop-scheduling problems with uncertain processing times, Proceedings of XI International Conference on Knowledge-Dialogue-Solution, FOI-Commerce, Sofia, Varna, Bulgaria, 20-24 June, 2005, pp. 375-381.
12. Lin, Y and Deng, J. 1999. On the structure of all optimal solutions of the two-machine flowshop scheduling problem. Oper. Res. Trans., 3: 10-20.
13. Lin, Y and Wang, X. 2007. Necessary and sufficient conditions of optimality for some classical scheduling problems. Euro. J. Oper. Res., 176: 809-818.
14. Matsveichuk, NM, Sotskov, YN, Egorova, NG and Lai, T-C. 2009. Schedule execution for two-machine flow-shop with interval processing times. Math. Comput. Model., 49: 991-1011.
15. Ng, CT, Matsveichuk, NM, Sotskov, YN and Cheng, TCE. 2009. Two-machine flow-shop minimum-length scheduling with interval processing times. Asia-Pac. J. Oper. Res., 26: 1-20.
16. Pinedo, M. 1995. Scheduling: Theory, Algorithms, and Systems, Englewood Cliffs, NJ: Prentice-Hall.
17. Slowinski, R and Hapke, M. 1999. Scheduling Under Fuzziness, Heidelberg, New York: Physica-Verlag.
18. Sotskov, YN, Allahverdi, A and Lai, T-C. 2004. Flowshop scheduling problem to minimize total completion time with random and bounded processing times. J. Oper. Res. Soc., 55: 277-286.
19. Sotskov, YN, Egorova, NG and Lai, T-C. 2009. Minimizing total weighted flow time of a set of jobs with interval processing times. Math. Comput. Model., 50: 556-573.