No-idle permutation flow shop scheduling problem with dominant machines

This paper deals with two special cases of the no-idle permutation flow shop scheduling problem. The first special case assumes a pair of joint series of increasing and decreasing dominating machines, while the second special case assumes a pair of joint series of decreasing and increasing dominating machines. Efficient solution procedures for finding the optimal permutation schedules for various performance measures, including makespan, weighted sum of completion times, maximum lateness, and the number of tardy jobs, are developed.