Evolutionary Clustering Search for Flowtime Minimization in Permutation Flow Shop

This paper deals with the Permutation Flow Shop scheduling problem with the objective of minimizing total flow time, and therefore reducing in-process inventory. A new hybrid metaheuristic Genetic Algorithm - Cluster Search is proposed for the scheduling problem solution. The performance of the proposed method is evaluated and results are compared with the best reported in the literature. Experimental tests show the new method superiority for the test problems set, regarding the solution quality.

[1]  Carlos Cotta,et al.  Genetic Forma Recombination in Permutation Flowshop Problems , 1998, Evolutionary Computation.

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

[3]  Mehmet Fatih Tasgetiren,et al.  A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem , 2007, Eur. J. Oper. Res..

[4]  Ben Paechter,et al.  Real-World Applications of Evolutionary Computing , 2003, Lecture Notes in Computer Science.

[5]  Thomas Sttzle,et al.  Applying iterated local search to the permutation ow shop problem , 1998 .

[6]  Carlos Cotta,et al.  Memetic Algorithms in Planning, Scheduling, and Timetabling , 2007, Evolutionary Scheduling.

[7]  Gary B. Lamont,et al.  Scheduling of Flow-Shop, Job-Shop, and Combined Scheduling Problems using MOEAs with Fixed and Variable Length Chromosomes , 2007, Evolutionary Scheduling.

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

[9]  James C. Bean,et al.  Genetic Algorithms and Random Keys for Sequencing and Optimization , 1994, INFORMS J. Comput..

[10]  Alexandre César Muniz de Oliveira,et al.  Detecting Promising Areas by Evolutionary Clustering Search , 2004, SBIA.

[11]  Jeffery L. Kennington,et al.  Interfaces in Computer Science and Operations Research , 1997 .

[12]  L. Darrell Whitley,et al.  Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology and Algorithm Performance , 2002, INFORMS J. Comput..

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

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

[15]  Gilbert Syswerda,et al.  Uniform Crossover in Genetic Algorithms , 1989, ICGA.

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

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

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

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

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

[21]  Alexandre César Muniz de Oliveira,et al.  Hybrid Evolutionary Algorithms and Clustering Search , 2007 .

[22]  Fred Glover,et al.  Tabu Search and Adaptive Memory Programming — Advances, Applications and Challenges , 1997 .

[23]  Daniel Merkle,et al.  An Ant Algorithm with a New Pheromone Evaluation Rule for Total Tardiness Problems , 2000, EvoWorkshops.

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

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

[26]  Chandrasekharan Rajendran,et al.  Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs , 2004, Eur. J. Oper. Res..

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

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

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

[30]  Marcelo Seido Nagano,et al.  Reducing mean flow time in permutation flow shop , 2008, J. Oper. Res. Soc..

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

[32]  R. Ahmadi,et al.  Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop , 1990 .

[33]  Jose M. Framiñan,et al.  Comparison of heuristics for flowtime minimisation in permutation flowshops Technical report IO-2003 / 01 Version 0 . 5 Last version : 26 / 07 / 2003 , 2004 .

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

[35]  Q. Wang,et al.  Efficient composite heuristics for total flowtime minimization in permutation flow shops , 2009 .