For the make-span minimization problem on two machines with periodic maintenance, it was shown that FFD algorithm was an efficient algorithm.

• 对于周期维护最小化时间表长问题，证明了经典的FFD算法是一个很好的启发式算法，并且得到了该算法的一个上界。