Job shop scheduling problems with Genetic Algorithms

The Job-Shop Scheduling Problem (JSSP) is an extremely difficult problem because it requires very large combinational search space and the precedence constraint between machines. A software tool called Hybrid and Flexible Genetic Algorithm (HybFlexGA) was developed for solving the JSSP. Computational results demonstrate that the proposed HybFlexGA is very efficient and potentially useful in solving the JSSP. The results obtained with standard JSSP benchmark demonstrate its efficiency.