A Hybrid and Flexible Genetic Algorithm for the Job-Shop Scheduling Problem

Abstract

A hybrid and flexible genetic algorithm (HybFlexGA) is presented for the job-shop scheduling problem (JSSP). The JSSP is one of the most difficult production scheduling problems in industry because it requires very large combinational search space and the precedence constraint between machines. The computational results on the well-known benchmark instances show the proposed HybFlexGA is very effective and competitive with other methods presented in the literature.