| Article ID: | iaor20041795 |
| Country: | United Kingdom |
| Volume: | 54 |
| Issue: | 10 |
| Start Page Number: | 1102 |
| End Page Number: | 1105 |
| Publication Date: | Oct 2003 |
| Journal: | Journal of the Operational Research Society |
| Authors: | Stafford E.F., Tseng F.T. |
| Keywords: | scheduling |
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.