An Evolutionary Approach Using Fuzzy Greedy Initialization to Permutation Flow-Shop Scheduling with the Makespan Criterion

摘要

This paper describes a genetic algorithm (GA) for the permutation flow-shop scheduling problem (PFSP) with the makespan criterion. A constructive heuristic is employed to generate an initial population for the proposed GA. Computational experiments using standard benchmark problems indicate that the proposed method is very effective.