A bi-criteria flow-shop scheduling with preventive maintenance

摘要

In this study, a bi-criteria flow-shop scheduling with preventive maintenance tasks is considered. The objective function of the scheduling is the minimization of the makespan and for the preventive maintenance is the minimization of the sum of the earliness and tardiness between theoretical and actual frequency for two machines. The integer programming model is presented and can be solved only small size problems. For large size problem, four meta-heuristics methods are presented. Two genetic algorithms (NSGAII and SPEAII) are implemented. 2 new versions of NSGAII (noted HY-NSGAII) and SPEAII (noted HY-SPEAII) based on Johnson algorithm are presented. To evaluate the proposed approaches several tests and metrics are proposed.