Flowshop scheduling with dominant machines

This paper examines two special cases of the n-job, m-machine permutation scheduling flowshop problem. The first case assumes an increasing series of dominating machines; while the second case assumes a decreasing series of dominating machines. Efficient solution procedures for finding the optimal permutation schedules for various performance measures, including maximum flowtime, mean flowtime, mean completion time of machines, the number of tardy jobs, maximum lateness, and maximum tardiness, are developed.