We consider the two-machine no-wait flow shop problem with separable setup times and single server side constraints, and makespan as the performance measure. This problem is strongly NP-hard. A mathematical model of the problem is developed and a number of propositions are proven for the special...

The paper considers a flowshop scheduling problem of a manufacturing cell that contains families of jobs whose setup times are dependent on the manufacturing sequence of the families. Two objectives, namely the makespan and total flow time, have been considered simultaneously in this work. Since...

The paper considers a flowshop scheduling problem of a manufacturing cell that contains families of jobs whose setup times are dependent on the manufacturing sequence of the families. Two objectives, namely the makespan and total flow time, have been considered simultaneously in this work. Since...