抄録
This paper deals with job shop scheduling problems in which overtime can be adjustable to meet due dates. The primal objective of scheduling is to meet due dates and the secondary one is to minimize overtime. For this purpose, we propose the scheduling method using the mixture of genetic algorithm and priority rule. Numerical experiments show that the proposed method can generate optimal or sub-optimal solutions when the scale of problem is small or time resolution is low. When the size of the problems is large and time resolution is high, although it becomes difficult to obtain optimal solutions, the performance of the proposed method is much better than other methods.
