PulseAugur
LIVE 06:56:54
tool · [1 source] ·

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

Summary written by gemini-2.5-flash-lite from 1 source. How we write summaries →

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 →

Petri Net Search Outperforms MIP Solvers on Scheduling Problems

COVERAGE [1]

  1. arXiv cs.AI TIER_1 · Izack Cohen ·

    Petri Net Induced Heuristic Search for Resource Constrained Scheduling

    We formulate the Resource-Constrained Project Scheduling Problem (RCPSP) as optimal search over the reachability graph of a Timed Transition Petri Net with Resources, using relative-delay tokens so that scheduling decisions correspond to transition firings in the induced state sp…