this paper develops a genetic algorithm for solving job shop scheduling problems. It discusses the difficulties arising from the traditional encoding of the problem And suggests a new encoding scheme. The paper also develops an analogue elec- trical system to represent the problem and uses the measure of that system to Develop a new measure for the fitness function of the genetic algorithm. The Algorithm considers the conventional genetic operations but with some modifica- tion. The computational results, developed for the makespan criterion, show that, For this criterion, the algorithm is reliable and performs relatively well.
展开▼
