关于推断累积约束
On inferring cumulative constraints
AI总结:
该研究提出了一种预处理方法,通过推断额外的累积约束来捕捉多资源交互,从而提高调度问题的搜索性能和目标界限精度。
摘要:
累积约束在约束编程的调度中至关重要,但通常按约束单独进行传播,忽略了多资源交互,导致某些基准测试严重变慢。我提出了一种预处理方法,用于推断额外的累积约束,以捕捉此类交互,而无需搜索时探测。该方法将累积约束解释为占用向量上的线性不等式,并通过(i)发现覆盖,即不能并行运行的任务集,(ii)通过提升加强发现的集合的覆盖不等式,以及(iii)将所得约束重新注入到调度问题实例中,生成有效的不等式。在标准RCPSP和RCPSP/max测试套件上的实验表明,这些推断出的约束在有利的实例上提高了搜索性能并收紧了目标界限,而在不利的实例上带来的退化很小。此外,这些实验发现了25个新下界和五个新最佳解;其中八个下界直接来自推断出的约束。
英文摘要:
Cumulative constraints are central in scheduling with constraint programming, yet propagation is typically performed per constraint, missing multi-resource interactions and causing severe slowdowns on some benchmarks. I present a preprocessing method for inferring additional cumulative constraints that capture such interactions without search-time probing. This approach interprets cumulative constraints as linear inequalities over occupancy vectors and generates valid inequalities by (i) discovering covers, the sets of tasks that cannot run in parallel, (ii) strengthening the cover inequalities for the discovered sets with lifting, and (iii) injecting the resulting constraints back into the scheduling problem instance. Experiments on standard RCPSP and RCPSP/max test suites show that these inferred constraints improve search performance and tighten objective bounds on favorable instances, while incurring little degradation on unfavorable ones. Additionally, these experiments discover 25 new lower bounds and five new best solutions; eight of the lower bounds are obtained directly from the inferred constraints.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。