A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility

This paper presents a genetic algorithm to solve the hybrid flow shop scheduling problem to minimize the total tardiness. Practical assumptions as unrelated machines and machine eligibility are considered. The proposed algorithm incorporates a new decoding method developed for total tardiness objective, which is able to obtain tight schedule meanwhile guarantee the influence of the chromosome on the schedule. The proposed algorithm has been calibrated with a full factorial design of experiment, and compared to several calibrated state-of-art algorithms on 450 instances with different size and correlation patterns of operation processing time. The results validate the effectiveness of the proposed algorithm