Job Shop Scheduling with Earliness and Tardiness Penalties Using Iterative Repair Method

Abstract

In this paper, we propose an approach based on iterative repair for job-shop scheduling problems. This approach had been successfully applied to railway scheduling problems. To show the flexibility of this approach, it has been adapted to the job-shop scheduling problems with weighted early/tardy objective in this paper. The weighted early/tardy objective is compatible with the philosophy of just-in-time (JIT) production to minimize inventory costs. Since the objective function is not a regular performance measure (i.e., a function that is non-decreasing in the completion times). It can not be solved by the conventional theorems on job ordering. The repair-based approach is successfully applied to solve the problems. Experimental results show the efficiency and effectiveness of this approach.