arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1909.11086cs.DS
收藏

单位时间工件的早工、晚工和资源均衡问题的通用近似框架

A common approximation framework for the early work, the late work, and resource leveling problems with unit time jobs

Peter Gyorgyi, Tamas Kis

摘要:

研究了两个相关机器排序问题的可逼近性。在后期工作最小化问题中,有相同的平行机和工件有一个共同的截止日期。目标是尽量减少迟交工作,迟交工作的定义是在到期日之后完成的工作部分的总和。一个相关的问题是早期工作的最大化,定义为在到期日之前完成的工作部分的总和。我们描述了一个多项式时间的近似计划,早期的工作最大化问题,我们将其扩展到后期的工作最小化问题后,转移的目标函数的一个正值,取决于问题的数据。我们还证明了后一个问题的不可逼近性结果,如果目标函数是由一个常数,不依赖于输入。这些结果仍然有效,即使分配给同一台机器的工作的数量是有界的。这导致我们的近似方案的一些变种的资源均衡问题,其中没有近似算法是已知的扩展。

英文摘要:

We study the approximability of two related machine scheduling problems. In the late work minimization problem, there are identical parallel machines and the jobs have a common due date. 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 some variants of the resource leveling problem, for which no approximation algorithms were known.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑