Scheduling with monotonous earliness and tardiness penalties (Q2366084): Difference between revisions

The problem of scheduling nonpreemptable jobs on one machine, is considered. Jobs are assigned due-dates and the aim is to schedule them as close to these due-dates as possible (``just-in-time'' scheduling). The objective function should be monotonous with respect to the absolute lateness. A pseudopolynomial-in-time algorithm is given for solving the problem. For a subclass of the above mentioned objective functions this algorithm is extended to a fully polynomial approximation scheme.