Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work
研究单机调度中机器有固定维护活动时，如何安排作业顺序以最小化总延迟工作量，提出了两个伪多项式动态规划算法和一个完全多项式时间近似方案，并通过数值实验验证性能。
Abstract We consider the problem of scheduling n independent and simultaneously available jobs without preemption on a single machine, where the machine has a fixed maintenance activity. The objective is to find the optimal job sequence to minimize the total amount of late work, where the late work of a job is the amount of processing of the job that is performed after its due date. We first discuss the approximability of the problem. We then develop two pseudo‐polynomial dynamic programming algorithms and a fully polynomial‐time approximation scheme for the problem. Finally, we conduct extensive numerical studies to evaluate the performance of the proposed algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 172–183, 2016