.png){kind=icon}
返回
Parallel-machine scheduling with simple linear deterioration to minimize total completion time
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2007.04.050.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider the parallel-machine scheduling problem in which the processing time of a job is a simple linear increasing function of its starting time. The objective is to minimize the total completion time. We give a fully polynomial-time approximation scheme (FPTAS) for the case with m identical machines, where m is fixed. This study solves an open problem that has been posed in the literature for ten years. (c) 2007 Elsevier B.V. All rights reserved.
Keyword:
parallel-machine scheduling
deteriorating jobs
FPTAS
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
.png){kind=icon}
分享收藏
MINIMIZING THE MAKESPAN WITH LATE START PENALTIES ADDED TO PROCESSING TIMES IN A SINGLE FACILITY SCHEDULING PROBLEM在单个设施调度问题中，通过增加处理时间的延迟启动惩罚来最小化完工时间
PREAI
分享收藏Demonstration of Chimeric DNA of bcl-2 and Immunoglobulin Heavy Chain in Follicular Lymphoma and Subsequent Hodgkin Lymphoma from the Same Patient同一患者的滤泡性淋巴瘤和随后的霍奇金淋巴瘤中bcl-2和免疫球蛋白重链的嵌合DNA的证明OAAI
OAAI分享收藏
查看更多内容