.png){kind=icon}
返回
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}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Scheduling
Maintenance
Workload
Approximation algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
O
IF:
7.2
论文数:
3.7K
被引数:
1.4W
机构
引用论文
.png){kind=icon}
Radiation exposure to the patient and operating room personnel during percutaneous nephrolithotomy
PREAI
分享收藏Scheduling a maintenance activity and due-window assignment based on common flow allowance根据公共流量津贴安排维护活动和到期窗口分配
PREAI
分享收藏Single machine scheduling with general positional deterioration and rate-modifying maintenance具有一般位置劣化和速率修改维护的单机调度
PREAI
分享收藏
查看更多内容