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

区间、资源受限和低秩调度的(不)近似性结果

(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling

Marten Maack, Simon Pukrop, Anna Rodriguez Rasmussen

摘要:

我们考虑的限制分配问题的一组工作必须分配给一组机器的变种,对于每个工作的大小和一组合格的机器是给定的,和工作可能只分配给合格的机器的目标是最大完工时间最小化。对于具有间隔限制的变体,其中机器可以被安排在一条路径上,使得每个作业都有资格在一个子路径上,我们提出了第一个优于$2$ -近似和改进的不可近似性结果。特别地,我们给出了一个$(2-\frac{1}{24})$ -近似,并表明,没有比$9/8$ -近似是可能的,除非P=NP。此外,我们考虑限制分配与$R$资源限制和排名$D$无关的调度。在前一个问题中,如果机器能够满足其关于$R$(可再生)资源的资源需求,则它可以处理作业。在后者中,作业的大小取决于它被分配到的机器,并且相应的处理时间矩阵的秩至多为$D$。具有间隔限制的问题包括1资源变量,由2资源变量包含,并且关于近似,$R$资源变量本质上是秩$R+1$问题的特殊情况。我们表明,没有更好的$3/2$,$8/7$,和$3/2$ -近似是可能的(除非P=NP)的3资源,2资源,和秩3的变体,分别。区间情况下的近似结果和秩3变量的不可近似结果都是对先前工作中所述的开放挑战的解决方案。最后,我们还考虑了反向目标,即最大化任何机器接收的最小负载,并获得类似的结果。

英文摘要:

We consider variants of the restricted assignment problem where a set of jobs has to be assigned to a set of machines, for each job a size and a set of eligible machines is given, and the jobs may only be assigned to eligible machines with the goal of makespan minimization. For the variant with interval restrictions, where the machines can be arranged on a path such that each job is eligible on a subpath, we present the first better than $2$-approximation and an improved inapproximability result. In particular, we give a $(2-\frac{1}{24})$-approximation and show that no better than $9/8$-approximation is possible, unless P=NP. Furthermore, we consider restricted assignment with $R$ resource restrictions and rank $D$ unrelated scheduling. In the former problem, a machine may process a job if it can meet its resource requirements regarding $R$ (renewable) resources. In the latter, the size of a job is dependent on the machine it is assigned to and the corresponding processing time matrix has rank at most $D$. The problem with interval restrictions includes the 1 resource variant, is encompassed by the 2 resource variant, and regarding approximation the $R$ resource variant is essentially a special case of the rank $R+1$ problem. We show that no better than $3/2$, $8/7$, and $3/2$-approximation is possible (unless P=NP) for the 3 resource, 2 resource, and rank 3 variant, respectively. Both the approximation result for the interval case and the inapproximability result for the rank 3 variant are solutions to open challenges stated in previous works. Lastly, we also consider the reverse objective, that is, maximizing the minimal load any machine receives, and achieve similar results.

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

↑