This paper presents an extension of an earlier model developed by the authors, formulating the generalized N job, M machine standard flow-shop problem as a mixed-integer goal-programming model. The ...

We show that the linear relaxation of the new formulation is tighter than that of the standard mixed integer programming formulation. We describe different classes of valid inequalities for the new ...