The paper deals with an m machine n job flow-shop problem with sequence dependent setup times. To find an approximate solution of this model a related (additive) model was constructed and solved. The method proved to be successful to find good solutions for a variety of test problems for m•8 and n•8. It guarantees optimality for the two machine case whenever the original model is additive.
