Introduction - If you have any usage issues, please Google them yourself
This paper deals with the job shop scheduling problem with due window to minimize the sum of weighted earliness and weighted tardiness of jobs. This due window is a time duration between the due date and the latest acceptable completion date, namely dealine, of a job. Penalties are incurred if jobs are completed within the due window and the illegal schedule will occur if one job is finished after its deadline. A new Enhanced Genetic Algorithm (EGA), based on a two phase schedule mechanism was introduced. To avoid the violations of due window constraint and simultaneously reduce tardiness costs, a chromosome repair method based on critical paths was designed to adjust chromogene sequence. Then, on keeping tardiness costs unchanged, an objective value revision method based on reverse rescheduling was put forward to delay job release date for reducing earliness costs introduced by each job.