Abstract NP-hard scheduling problems with the criterion of minimizing the maximum penalty, e.g. maximum lateness, are considered. For such problems, a metric which delivers an upper bound on the absolute error of the objective function value is introduced. Taking the given instance of some problem and using the introduced metric, the nearest instance is determined for which a polynomial or pseudo-polynomial algorithm is known. A schedule is constructed for this determined instance which is then applied to the original instance. It is shown how this approach can be applied to different scheduling problems.

中文翻译：

---

一种最小化最大惩罚的调度问题的度量方法

摘要 考虑了以最小化最大惩罚为准则的 NP-hard 调度问题，例如最大延迟。对于此类问题，引入了提供目标函数值绝对误差上限的度量。取一些问题的给定实例并使用引入的度量，确定已知多项式或伪多项式算法的最近实例。为这个确定的实例构建一个时间表，然后将其应用于原始实例。展示了这种方法如何应用于不同的调度问题。