A heuristic approach to parallel machine scheduling with earliness and tardiness penalties

Identical parallel machine scheduling problems with earliness and tardiness penalties are studied. First, a hybrid method adopting the meta-heuristics and the list scheduling techniques is proposed, where a heuristic procedure MPA (Minimum Penalty increase Assignment) is newly introduced. Then, through several computational experiments, the effectiveness of the proposed method is shown.