Scheduling with earliness and tardiness penalties

The paper shows that the deterministic nonpreemptive scheduling problem with earliness and tardiness penalties can be solved in polynomial time for certain forms of an objective function provided that a certain optimization problem can be solved. It gives instances where this problem has a solution and shows that this generalizes several results from the literature. These results do not require symmetric penalization and the penalty functions need only be lower semicontinuous.