.png){kind=icon}
.png){kind=icon}
Return
On single-machine scheduling with workload-dependent maintenance duration
.png){kind=icon}
PRE
AI
DOI：10.1016/j.omega.2016.06.008.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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+epsilon)-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]. (C) 2016 Elsevier Ltd. All rights reserved.
Keywords:
Scheduling
Maintenance
Workload
Approximation scheme
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
O
IF:
7.2
Papers:
3.7K
Citations:
1.4W