A Hybrid Genetic Algorithm for the Distributed Permutation Flowshop Scheduling Problem

摘要

For solving the distributed permutation flowshop scheduling problem (DPFSP) with the objective of minimizing makespan we design a hybrid genetic algorithm. This algorithm combines a simple genetic algorithm, a local search algorithm and a plant allocation rule with the aim of minimizing the makespan. The experimental results show that the proposed algorithm outperforms the genetic algorithm in terms of efficiency and effectiveness for parts of the data.