Three-machine flowshop scheduling problem to minimize total completion time with bounded setup and processing times

The three-machine flowshop scheduling problem to minimize total completion time is studied where setup times are treated as separate from processing times. Setup and processing times of all jobs on all machines are unknown variables before the actual occurrence of these times. The lower and upper bounds for setup and processing times of each job on each machine is the only information that is available. In such a scheduling environment, there may not exist a unique schedule that remains optimal for all possible realizations of setup and processing times. Therefore, it is desired to obtain a set of dominating schedules (which dominate all other schedules) if possible. The objective for such a scheduling environment is to reduce the size of dominating schedule set. We obtain global and local dominance relations for a three-machine flowshop scheduling problem. Furthermore, we illustrate the use of dominance relations by numerical examples and conduct computational experiments on randomly generated problems to measure the effectiveness of the developed dominance relations. The computational experiments show that the developed dominance relations are quite helpful in reducing the size of dominating schedules.