Treffer: Scheduling with monotonous earliness and tardiness penalties

We discuss the one-machine-model with deterministic processing times. In the first part we restrict the model to the common due date case. In the second part an equivalence between this model and the'Equal Slack Due Date' model is shown. As a penalty function F we use the sum of identical functions f of the lateness (both earliness and tardiness). The function f must be monotonous with respect to the absolute lateness. No other restrictions are necessary. Several special cases are known in the literature and summarized here to show the generality of our approach. This idea of penalizing jobs whose completion times deviate from their due date arises in some schedulizing jobs whose completion times deviate from their due date arises in some scheduling models for «just-in-time» production.