Abstract
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 space. We solve the resulting problem with A∗ guided by a heuristic that combines Critical Path and resource-based lower bounds, and prove that the heuristic is consistent under our token-based time semantics. Experiments on the PSPLIB benchmarks show that the approach outperforms strong exact Mixed-Integer Linear Programming (MIP) baselines (SCIP, CBC) in success rate and solve time. Per-instance analysis shows that heuristic search and MIP degrade along independent axes, resource tightness for A∗ and formulation size for MIP, with resource strength mediating which solver benefits from scale.
| Original language | English |
|---|---|
| Pages (from-to) | 234-239 |
| Number of pages | 6 |
| Journal | The International Symposium on Combinatorial Search |
| Volume | 19 |
| Issue number | 1 |
| DOIs | |
| State | Published - 2026 |
| Event | 19th International Symposium on Combinatorial Search, SoCS 2025 - Bremerhaven, Germany Duration: 14 Aug 2026 → 16 Aug 2026 |
Bibliographical note
Publisher Copyright:© 2026, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.
Fingerprint
Dive into the research topics of 'Petri Net Induced Heuristic Search for Resource Constrained Scheduling'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver