Abstract
This paper studies the scheduling problem of Hybrid Flow Shop (HFS) under the objective of minimizing makespan. The corresponding scheduling simulation system is developed in details, which employed a new encoding method so as to guarantee the validity of chromosomes and the convenience of calculation. The corresponding crossover and mutation operators are proposed for optimum sequencing. The simulation results show that the adaptive Genetic Algorithm (GA) is an effective and efficient method for solving HFS Problems.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call