P-范数的流和拉伸排序的复杂性
The Complexity of Scheduling for p-norms of Flow and Stretch
摘要:
我们考虑计算最优的k-范数抢占时间表的工作,随着时间的推移到达。特别是,我们表明,计算流调度的最佳k-范数,是强NP-困难的k(0,1)和整数k(1,无穷大)。进一步证明了当k ∈(0,1)和整数k ∈(1,无穷大)时,计算拉伸调度的最优k-范数是强NP-困难的.
英文摘要:
We consider computing optimal k-norm preemptive schedules of jobs that arrive over time. In particular, we show that computing the optimal k-norm of flow schedule, is strongly NP-hard for k in (0, 1) and integers k in (1, infinity). Further we show that computing the optimal k-norm of stretch schedule, is strongly NP-hard for k in (0, 1) and integers k in (1, infinity).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。