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

References

• 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 .
   Google Scholar
• 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 .
   Google Scholar
• 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 .
   Web of Science ®Google Scholar
• 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 .
   Google Scholar
• Johnson , SM . 1954 . Optimal two- and three-stage production schedules with setup times included . Naval Res. Logist. Quart. , 1 : 61 – 68 .
   Google Scholar
• 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 .
   Web of Science ®Google Scholar
• Kouvelis , P and Yu , G . 1997 . Robust Discrete Optimization and its Applications , Boston : Kluwer Academic Publishers .
   Google Scholar
• Lai , T-C and Sotskov , YN . 1999 . Sequencing with uncertain numerical data for makespan minimization . J. Oper. Res. Soc. , 50 : 230 – 243 .
   Web of Science ®Google Scholar
• 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 .
   Google Scholar
• 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 .
   Google Scholar
• 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.
   Google Scholar
• 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 .
   Google Scholar
• Lin , Y and Wang , X . 2007 . Necessary and sufficient conditions of optimality for some classical scheduling problems . Euro. J. Oper. Res. , 176 : 809 – 818 .
   Google Scholar
• 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 .
   Google Scholar
• 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 .
   Google Scholar
• Pinedo , M . 1995 . Scheduling: Theory, Algorithms, and Systems , Englewood Cliffs, NJ : Prentice-Hall .
   Google Scholar
• Slowinski , R and Hapke , M . 1999 . Scheduling Under Fuzziness , Heidelberg, New York : Physica-Verlag .
   Google Scholar
• 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 .
   Web of Science ®Google Scholar
• 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 .
   Google Scholar