Algorithms for parallel processor scheduling with distinct due windows and unit-time jobs

We have studied problem of scheduling n unit-time jobs on m, identical parallel processors, in which for each job a distinct due window is given in advance. If a job is completed within its due window, then it incurs no penalty. Otherwise, it incurs a job-dependent earliness or tardiness cost. The objective is to find a job schedule such that the total weighted earliness and tardiness, maximum weighted earliness and tardiness or total weighted number of early and tardy jobs is minimized. Properties of optimal solutions of these problems are established. We proved that optimal Solutions for these problems can be found in O(n(5)) time in case of minimization of the total weighted earliness and tardiness and the total weighted number of early and tardy jobs and in O(n(4) root nlogn) time in case of minimization of the maximum weighted earliness and tardiness. The established solution methods are extended to solve the problem with arbitrary integer release dates. A dedicated algorithm with time complexity O(n(3)) is provided for the special case of the problem of minimizing total weighted number of early and tardy jobs with agreeable earliness-tardiness weights.