A genetic algorithm to obtain dead-lock free schedules for No-buffer jobshop scheduling problems

摘要

A genetic algorithm is proposed to obtain dead-lock free schedules for no-buffer jobshop scheduling problems. the main contribution of this research, the proposal of a new decoding method ensuring no violation of no-buffer constraints enables genetic algorithms to handle the no-buffer jobshops. Experiment results on some modified benchmark problems. show that the proposed algorithm obtains equivalent or better schedules than those given by available literature.