A new integer programming formulation for the permutation flowshop problem

Abstract We 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. We present some computational experience.

[1]  A. Kan.  Machine Scheduling Problems: Classification, Complexity and Computations , 1976 .

[2]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[3]  William L. Maxwell,et al.  Theory of scheduling , 1967 .

[4]  Leon S. Lasdon,et al.  Optimization Theory of Large Systems , 1970 .

[5]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[6]  Jan Karel Lenstra,et al.  Sequencing by enumerative methods , 1977 .

[7]  Z. A. Lomnicki,et al.  Some Applications of the “Branch-and-Bound” Algorithm to the Machine Scheduling Problem , 1966 .

[8]  Richard D. Smith,et al.  A General Algorithm for Solution of the n-Job, M-Machine Sequencing Problem of the Flow Shop , 1967, Oper. Res..

[9]  B. J. Lageweg,et al.  A General Bounding Scheme for the Permutation Flow-Shop Problem , 1978, Oper. Res..

[10]  Richard Bellman,et al.  Mathematical Aspects Of Scheduling And Applications , 1982 .

[11]  N. A. J. Hastings,et al.  A New Bound for Machine Scheduling , 1976 .

[12]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[13]  G. B. McMahon,et al.  Flow-Shop Scheduling with the Branch-and-Bound Method , 1967, Oper. Res..

[14]  L. Khachiyan.  Polynomial algorithms in linear programming , 1980 .

[15]  Kenneth R. Baker,et al.  A Comparative Study of Flow-Shop Algorithms , 1975, Oper. Res..

[16]  Chris N. Potts,et al.  An adaptive branching rule for the permutation flow-shop problem , 1980 .

[17]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[18]  R. A. Dudek,et al.  A Heuristic Algorithm for the n Job, m Machine Sequencing Problem , 1970 .

[19]  E. Ignall,et al.  Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Problems , 1965 .

[20]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[21]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[22]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[23]  H. M. Wagner,et al.  Approximate Solutions to the Three-Machine Scheduling Problem , 1964 .

[24]  W. Szwarc.  Elimination methods in the m × n sequencing problem , 1971 .

[25]  Z. A. Lomnicki.  A “Branch-and-Bound” Algorithm for the Exact Solution of the Three-Machine Scheduling Problem , 1965 .