Two-machine flowshop minimum-length scheduling problem with random and bounded processing times

We address the two-machine flowshop scheduling problem to minimize makespan where jobs have random and bounded processing times. The probability distributions of job processing times are unknown and only the lower and upper bounds of processing times are given before scheduling. In such cases there may not exist a unique schedule that remains optimal for all possible realizations of processing times, and therefore, a set of schedules has to be considered which dominates all other schedules. In this paper, we find some sufficient conditions for the considered problem.