具有相容性约束的耦合任务调度的界和近似结果
Bounds and approximation results for scheduling coupled-tasks with compatibility constraints
摘要:
本文根据经典的复杂性假设($\mathcal{P} \neq \mathcal{NP}$,$\mathcal{ETH}$),给出了具有相容性约束的耦合任务调度问题的上下界.此外,我们开发了一个有效的多项式时间的近似算法的特定情况下,描述的兼容性约束的拓扑结构是一个准分裂图。
英文摘要:
This article is devoted to propose some lower and upper bounds for the coupled-tasks scheduling problem in presence of compatibility constraints according to classical complexity hypothesis ($\mathcal{P} \neq \mathcal{NP}$, $\mathcal{ETH}$). Moreover, we develop an efficient polynomial-time approximation algorithm for the specific case for which the topology describing the compatibility constraints is a quasi split-graph.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。