RCPSP is solved as A* search on a Petri-net reachability graph with a consistent Critical-Path-plus-resource heuristic that outperforms SCIP and CBC on PSPLIB instances.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Petri Net Induced Heuristic Search for Resource Constrained Scheduling
RCPSP is solved as A* search on a Petri-net reachability graph with a consistent Critical-Path-plus-resource heuristic that outperforms SCIP and CBC on PSPLIB instances.