Genetic Algorithms Efficiency In Flow ShopScheduling

This paper concerns Genetic Algorithms efficiency in solving the pure flow-shop scheduling problem. Different formulations of the crossover operator and setting of control parameters are investigated in order to obtain enhanced performances in the determination of minimum makespan schedules. A lower bound based ending criterion is also introduced to obtain computation fastening.