| Article ID: | iaor1989502 |
| Country: | Netherlands |
| Volume: | 40 |
| Issue: | 1 |
| Start Page Number: | 90 |
| End Page Number: | 98 |
| Publication Date: | May 1989 |
| Journal: | European Journal of Operational Research |
| Authors: | Frieze A.M., Yadegar J. |
| Keywords: | programming: integer |
The authors describe a new integer programming formulation for the permutation flowshop problem in which the objective is to minimise the makespan. This formulation can have an exponential number of constraints, but its linear programming relaxation can be solved by a novel (row generation) algorithm in polynomial time. The authors present some computational experience.