.png){kind=icon}
Return
Single machine total completion time scheduling problem with workload-dependent maintenance duration
.png){kind=icon}
PRE
AI
DOI：10.1016/j.omega.2014.11.002.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A single-machine scheduling problem with workload-dependent maintenance duration is considered. The objective is to Minimize total completion time. For the case where the derivation of the maintenance duration function is greater than or equal to 1, a polynomial time optimal algorithm is proposed. For the case where the derivation of the maintenance duration function is less than 1, a polynomial time approximation scheme is proposed. (C) 2014 Elsevier Ltd. All rights reserved.
Keywords:
Scheduling
Maintenance
Workload
Approximation algorithm
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
Organization
Cited Papers
.png){kind=icon}
Radiation exposure to the patient and operating room personnel during percutaneous nephrolithotomy
PREAI
ShareSaveShareSaveShareSaveShareSave
View more