Comparison of heuristics for flowtime minimisation in permutation flowshops Technical report IO-2003 / 01 Version 0 . 5 Last version : 26 / 07 / 2003

In this paper, we address the problem of sequencing jobs in a permutation flow shop with the objective of minimising the sum of completion times or flowtime. This objective is considered to be relevant and meaningful for today's dynamic production environment, and therefore it has attracted the attention of researchers during the last years. As a result, a number of different types of heuristics have recently been developed, each one claiming to be the best for the problem. However, some of these heuristics have been independently developed and only partial comparisons among them exist. Consequently, there are no conclusive results on their relative performance. Besides, some of these types of heuristics are of a different nature and could be combined in order to obtain composite heuristics. In this paper, we first classify and conduct an extensive comparison among the existing heuristics. Secondly, based on the results of the experiments, we suggest two new composite heuristics for the problem. The subsequent computational experience shows these two heuristics to be efficient for the problem under consideration.

[1]  Jean-Marie Proth,et al.  Heuristic approaches for n/m/F/ ∑Ci scheduling problems , 1997 .

[2]  Johnny C. Ho,et al.  Flowshop sequencing with mean flowtime objective , 1995 .

[3]  D. Chaudhuri,et al.  An efficient heuristic approach to the scheduling of jobs in a flowshop , 1992 .

[4]  James L. Kenkel,et al.  Introductory Statistics for Management and Economics , 1984 .

[5]  C. Rajendran,et al.  Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem , 2003 .

[6]  Richard A. Dudek,et al.  Development of M-Stage Decision Rule for Scheduling N Jobs Through M Machines , 1964 .

[7]  Hoon-Shik Woo,et al.  A heuristic algorithm for mean flowtime objective in flowshop scheduling , 1998, Comput. Oper. Res..

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

[9]  Jiyin Liu,et al.  Constructive and composite heuristic solutions to the P// Sigma Ci scheduling problem , 2001, Eur. J. Oper. Res..

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

[11]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[12]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[13]  Sihgeji Miyazaki,et al.  AN ADJACENT PAIRWISE APPROACH TO THE MEAN FLOW-TIME SCHEDULING PROBLEM. , 1978 .

[14]  Lixin Tang,et al.  A modified genetic algorithm for the flow shop sequencing problem to minimize mean flow time , 2002, J. Intell. Manuf..

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

[16]  Ali Allahverdi,et al.  New heuristics to minimize total completion time in m-machine flowshops , 2002 .

[17]  C. Rajendran.  Heuristic algorithm for scheduling in a flowshop to minimize total flowtime , 1993 .

[18]  Jose M. Framiñan,et al.  A review and classification of heuristics for permutation flow-shop scheduling with makespan objective , 2004, J. Oper. Res. Soc..

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

[20]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[21]  Jatinder N. D. Gupta,et al.  Heuristic Algorithms for Multistage Flowshop Scheduling Problem , 1972 .

[22]  Jose M. Framiñan,et al.  Production , Manufacturing and Logistics Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation , 2002 .

[23]  Stanley F. Bullington,et al.  An effective heuristic for flow shop problems with total flow time as criterion , 1993 .

[24]  J. Framiñan,et al.  An efficient constructive heuristic for flowtime minimisation in permutation flow shops , 2003 .

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

[26]  C. Rajendran,et al.  An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs , 1997 .