A travelling salesman approach to solve the F

This paper investigates the F =no-idle=Cmax problem, where machines work continuously without idle time intervals. The idle characteristic is a very strong constraint and it affects seriously the value of Cmax criterion. We treat here only the permutation flow-shop configuration for machine no-idle problems with the objective to minimise the makespan. Based on the idea that this problem can be modelled as a travelling salesman problem, an adaptation of the well-known nearest insertion rule is proposed to solve it. A computational study shows the result quality.

[1]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[2]  D. Pohoryles,et al.  Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times , 1982 .

[3]  R Wolfler Calvo,et al.  A New Heuristic for the Travelling Salesman Problem with Time Windows. , 2000 .

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

[5]  A. Hertz,et al.  A new heuristic method for the flow shop sequencing problem , 1989 .

[6]  Seetharama L. Narasimhan,et al.  A COMPARISON OF SEQUENCING RULES FOR A TWO‐STATE HYBRID FLOW SHOP , 1987 .

[7]  Aliza Main,et al.  The travelling salesman problem , 1996 .

[8]  Michel Minoux,et al.  Graphes et algorithmes , 1995 .

[9]  Seetuarma L. Narastmhan,et al.  Scheduling in a two-stage manufacturing process , 1984 .

[10]  É. Taillard.  Some efficient heuristic methods for the flow shop sequencing problem , 1990 .

[11]  V. S. Tanaev,et al.  Scheduling Theory: Multi-Stage Systems , 1994 .

[12]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

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

[14]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

[15]  Krzysztof Giaro.  NP-hardness of compact scheduling in simplified open and flow shops , 2001, Eur. J. Oper. Res..

[16]  David G. Dannenbring,et al.  An Evaluation of Flow Shop Sequencing Heuristics , 1977 .

[17]  A. Guinet.  Transports industriels routiers, un problème d'affectation avec réemploi sous contraintes , 1984 .