Job shop scheduling for meeting due dates and minimizing overtime with the constraint of the number of operators

抄録

This paper proposes an efficient scheduling method for job shop scheduling with regard to meeting due dates and minimizing overtime. The constraint of the number of operators, automatic operations and manual operations are explicitly considered. A genetic algorithm incorporating priority rule is applied for this problem. The effectiveness of the proposed method is examined through numerical experiments. The problem is also formulated by a integer programing model. Some small scale examples are solved optimally and used for comparison with the proposed method.