Polynomial time algorithms for the UET permutation flowshop problem with time delays

This paper addresses the problem of scheduling a set of n unit execution time (UET) jobs on an m-permutation flowshop with arbitrary time delays, so as to minimize the makespan criterion. A polynomial time algorithm is exhibited for the three-machine and four-machine cases, respectively