Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines
In this paper, we study the permutation flow shop scheduling problems with deteriorating jobs on no-idle dominant machines. The objective is to minimize one of the two regular performance criteria, namely, makespan and total completion time. For each objective, the following dominant machines constraint: idm, ddm, idmddm and ddmidm are considered. We present a polynomial time solution algorithm for each of the four cases.
scheduling deteriorating jobs dominant machines permutation flow shop algorithm