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

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

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

Read on arXiv cs.AI →

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

• paper
• other

AI-generated summary · Google Gemini · from 1 sources. How we write summaries →