On redundant constraints in Staffords MILP model for the flowshop problem

This paper investigates a claim that the 1988 Stafford mixed-integer linear programming model for the flowshop with permutation schedules contained a set of redundant constraints that could be eliminated without loss of model feasibility. This claim is shown to be incorrect mathematically and through the use of a counterexample problem. Eight additional problems were solved to confirm these findings.