PARALLEL SCHEDULING PROBLEM WITH NON-SIMULTANEOUS MACHINE AVAILABLE TIMES
带机器准备时间的平行机排序问题

This paper is concerned with the parallel scheduling problem on $m$ machines with non-simultaneous machine available times. A polynomial-time approximation scheme with running time $O(mn)$ for the general case and a full polynomial-time approximation scheme with running time $O(n)$ for the fixed number $m$ of machines are presented.