抄録
This paper deals with job shop scheduling with alternative machines. Genetic algorithm incorporating heuristic rules for job selection and machine selection is used for searching schedules to minimize mean tardiness of jobs. As heuristic rules, SL/RPN + SPT rule is used for job selection and (WINQ+RPT+PT)×PT rule is used for machine selection. Numerical experiments are carried out to evaluate the performance of the proposed method in comparison with a genetic algorithm proposed by Moon et al, a Lagrangian relaxation method and a mixed integer programing method. Experimental results show that the proposed method outperforms the other methods in larger scale of problems.
