.png){kind=icon}
返回
A common approximation framework for early work, late work, and resource leveling problems
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2020.03.032.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We study the approximability of four scheduling problems on identical parallel machines. In the late work minimization problem, the jobs have arbitrary processing times and a common due date, and the objective is to minimize the late work, defined as the sum of the portion of the jobs done after the due date. A related problem is the maximization of the early work, defined as the sum of the portion of the jobs done before the due date. We describe a polynomial time approximation scheme for the early work maximization problem, and we extended it to the late work minimization problem after shifting the objective function by a positive value that depends on the problem data. We also prove an inapproximability result for the latter problem if the objective function is shifted by a constant which does not depend on the input. These results remain valid even if the number of the jobs assigned to the same machine is bounded. This leads to an extension of our approximation scheme to two variants of the resource leveling problem with unit time jobs, for which no approximation algorithm is known. (C) 2020 Elsevier B.V. All rights reserved.
Keyword:
Scheduling
late work minimization
early work maximization
resource leveling
approximation algorithms
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
.png){kind=icon}
Procedures for resource leveling and net present value problems in project scheduling with general temporal and resource constraints具有一般时间和资源限制的项目计划中的资源均衡和净现值问题的程序
PREAI
分享收藏
查看更多内容