A genetic algorithm for JIT single machine scheduling with preemption and machine idle time

This paper concerns with the concept of preemption in just-in-time single machine scheduling problem, with allowable machine idle time. We proposed a new model, with non-linear terms and integer variables which cannot be solved efficiently for large size problems due to its NP-hardness. To solve the model for real size applications, genetic algorithm is applied. These genetic procedures are also quite close to the optimum and provided an optimal solution for most of the test problems. Numerical examples show that the proposed algorithm is efficient and effective.

Research highlights
► This paper considers a single machine scheduling problem with early-tardy costs.
► The problem is investigated with allowable preemption and machine idle time.
► We proposed a new model, which cannot be solved efficiently for large size problems.
► To solve the model for real size applications, a genetic algorithm is applied.
► Numerical examples show that the proposed algorithm is efficient and effective.