Petri Net Search Outperforms MIP Solvers on Scheduling Problems

Researchers have developed a new heuristic search method for the Resource-Constrained Project Scheduling Problem (RCPSP). This approach models scheduling decisions as transitions in a Timed Transition Petri Net with resources. Experiments on standard benchmarks indicate that this new method surpasses existing Mixed-Integer Linear Programming solvers in both success rate and speed. AI

影响 Introduces a novel algorithmic approach that demonstrates superior performance over existing methods for complex scheduling tasks.

排序理由 The cluster contains a research paper detailing a new algorithm and benchmark results. [lever_c_demoted from research: ic=1 ai=1.0]

在 arXiv cs.AI 阅读 →

• A*
• Petri Net
• PSPLIB
• Resource-Constrained Project Scheduling Problem (RCPSP)

• 论文
• 其他

AI 生成摘要 · Google Gemini · 来自 1 个来源。 我们如何撰写摘要 →