抄録
This paper deals with bi-criteria job shop scheduling for meeting due-dates and minimizing setup times. An efficient search method using the mixture of a genetic algorithm and a priority rule is proposed. In the method, the individuals of the genetic algorithm are ranked using a lexicographic ordering approach. A parameter of the priority rule to be mixed with the genetic algorithm is set to have high performance for minimizing tardiness until the schedule having no tardy job is found. A lot-splitting method is applied to meet due dates if necessary. After the schedule having no tardy jobs is found, the parameter is gradually shifted to have high performance for minimizing setup times. By appropriately tuning the shifting speed of the parameter, the proposed method can efficiently minimize setup times. Numerical experiments show the effectiveness of the proposed method.
