arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2107.08102cs.CCcs.DM
收藏

具有时滞的开放车间调度问题的复杂性

On the complexity of open shop scheduling with time lags

Wieslaw Kubiak

摘要:

即使在两台机器和单位时间作业的情况下,带时滞的开放式车间的最小完工时间问题也被证明是强NP-难的。然而,总完工时间的最小化仍然是开放的情况下,虽然它已被证明是NP-困难的加权总完工时间或发布日期的工作在很强的意义。本文证明了两台机器和单位时间操作的总完工时间的极小化问题是强NP困难的,从而回答了长期以来的一个公开问题。

英文摘要:

The minimization of makespan in open shop with time lags has been shown NP-hard in the strong sense even for the case of two machines and unit-time operations. The minimization of total completion time however has remained open for that case though it has been shown NP-hard in the strong sense for weighted total completion time or for jobs with release dates. This note shows that the minimization of total completion time for two machines and unit-time operations is NP-hard in the strong sense which answers the long standing open question.

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

↑