resource-constrained-scheduling

This paper models the Resource-Constrained Project Scheduling Problem as optimal search over a Petri net reachability graph and solves it with A* guided by a consistent heuristic combining critical path and resource lower bounds, outperforming MIP baselines on PSPLIB benchmarks.