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.

• Type: Conference
• Year: 2007
• Where: HM
• Authors: Geraldo Ribeiro Filho, Marcelo Seido Nagano, Luiz Antonio Nogueira Lorena
• Keywords: Artificial Intelligence, Flow Shop Scheduling Problem, HM 2007, Scheduling Problem Solution, Total flow Time