On single-machine scheduling with workload-dependent maintenance duration

In this paper, we consider a single-machine scheduling problem with workload-dependent maintenance duration. The objective is to minimize the total weighted completion time. For the case where the maintenance duration is an arbitrarily non-decreasing function on the workload, we propose a (2+ε)-approximation algorithm and a fully polynomial time approximation scheme, which extends the previous results presented by Xu et al. [Single machine total completion time scheduling problem with workload-dependent maintenance duration. Omega 2015;52:101-6].