Abstract

We consider a range of scheduling problems with controllable processing times, in which the jobs must be completed by a common deadline by compressing appropriately their processing times. The objective is to minimize the maximum compression cost. We present a number of algorithms based on common general principles adapted with a purpose of reducing the resulting running times.

中文翻译：

---

通过可控制的处理时间和共同的期限来安排问题，以最大程度地降低最大压缩成本

摘要

我们考虑了一系列具有可控制处理时间的调度问题，其中必须通过适当压缩其处理时间在共同的截止日期之前完成作业。目的是使最大压缩成本最小化。我们提出了一些基于通用一般原理的算法，这些算法经过调整，旨在减少运行时间。