A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date

This study focuses on a class of single-machine scheduling problems with a common due date where the objective is to minimize the total earliness-tardiness penalty for the jobs. A sequential exchange approach utilizing a job exchange procedure and three previously established properties in common due date scheduling was developed and tested with a set of benchmark problems. The developed approach generates results better than not only those of the existing dedicated heuristics but also in many cases those of meta-heuristic approaches. And the developed approach performs consistently well in various job settings with respect to the number of jobs, processing time and earliness-tardiness penalties for the jobs.