arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1709.04169cs.DS
收藏

准时化流水车间调度问题的参数化可溯性

On The Parameterized Tractability of the Just-In-Time Flow-Shop Scheduling Problem

Danny Hermelin, Dvir Shabtay, Nimrod Talmon

摘要:

自90年代初提出以来,参数化复杂性已被广泛用于分析许多NP难组合优化问题关于各种问题参数的易处理性。虽然框架的通用性允许分析任何组合问题,但多年来的主要焦点是分析图问题。在本文中,我们偏离了这一趋势,通过研究参数化的复杂性的准时(JIT)流水车间调度问题。我们的分析重点的情况下,到期日的数量是远远小于工作的数量,因此可以被视为一个参数。我们证明了两台机器的问题是W[1]-困难的关于这个参数,即使所有的加工时间在第二台机器上的单位长度,而问题是在XP中,即使一个参数化的机器数量。然后,我们继续研究的易处理性的问题时,结合不同数量的到期日的数量不同的权重或数量的不同的处理时间的第一台机器。我们证明了在这两种情况下,问题是固定参数的两台机器的情况下,易处理的,是W[1]-困难的三台或更多的机器。

英文摘要:

Since its development in the early 90's, parameterized complexity has been widely used to analyze the tractability of many NP-hard combinatorial optimization problems with respect to various types of problem parameters. While the generic nature of the framework allows the analysis of any combinatorial problem, the main focus along the years was on analyzing graph problems. In this paper we diverge from this trend by studying the parameterized complexity of Just-In-Time (JIT) flow-shop scheduling problems. Our analysis focuses on the case where the number of due dates is considerably smaller than the number of jobs, and can thus be considered as a parameter. We prove that the two-machine problem is W[1]-hard with respect to this parameter, even if all processing times on the second machine are of unit length, while the problem is in XP even for a parameterized number of machines. We then move on to study the tractability of the problem when combining the different number of due dates with either the number of different weights or the number of different processing times on the first machine. We prove that in both cases the problem is fixed-parameter tractable for the two machine case, and is W[1]-hard for three or more machines.

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

↑