An adaptive branching rule for the permutation flow-shop problem

Abstract A branch-and-bound algorithm is presented for the permutation flow-shop problem in which the objective is to minimise the maximum completion time. A branching procedure is used in which jobs both at the beginning and at the end of the schedule have been fixed. Dominance rules are included in the algorithm. Also, during the initial stages of the algorithm, upper bounds are computed at certain nodes of the search tree. Computational results indicate that the proposed algorithm is superior to previously published algorithms.

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

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

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

[4]  Ichiro Nabeshima,et al.  ON THE BOUND OF MAKESPANS AND ITS APPLICATION IN M MACHINE SCHEDULING PROBLEM , 1967 .

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

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

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

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

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

[10]  J. Lenstra,et al.  Job-Shop Scheduling by Implicit Enumeration , 1977 .

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

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

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

[14]  Said Ashour,et al.  INVESTIGATION OF VARIOUS BOUNDING PROCEDURES FOR PRODUCTION SCHEDULING PROBLEMS , 1968 .

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

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

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