中文摘要：

在这份报纸，安排问题的一台平行机器被考虑，在一个工作的处理时间是它的开始的时间的简单线性功能的地方。目的是最小化 makespan。一充分为安排败坏的 n 的问题的多项式时间近似计划二台相同机器上的工作被得出。而且，结果被概括到机器的一个固定数字的盒子。

英文摘要：

In this paper, a parallel machine scheduling problem was considered , where the processing time of a job is a simple linear function of its starting time. The objective is to minimize makespan. A fully polynomial time approximation scheme for the problem of scheduling n deteriorating jobs on two identical machines was worked out. Furthermore, the result was generalized to the case of a fixed number of machines.