A note on flow shop scheduling problems with a learning effect on no-idle dominant machines

This paper considers some permutation flow shop scheduling problems with a learning effect on no-idle dominant machines. The objective is to minimize maximum completion time. This objective is considered under following dominant machines constraint: idm, ddm, idm-ddm and ddm-idm. We present a polynomial-time solution algorithm for each of the above cases.