抄録
We have already proposed a job shop scheduling method to meet due-dates and to minimize overtime as far as possible. The sequence of operations of jobs is determined using the mixture of genetic algorithm and priority rule. In this report, we evaluate the performance of the proposed method by comparing it with lower bounds solved using a Lagrangian relaxation method. Numerical experiments show that the performance of the proposed method depends on the scale of problem and resolution time.
