Skip to main navigation Skip to search Skip to main content

Petri Net Induced Heuristic Search for Resource Constrained Scheduling

  • Bar-Ilan University

Research output: Contribution to journal › Conference article › peer-review

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 languageEnglish
Pages (from-to)234-239
Number of pages6
JournalThe International Symposium on Combinatorial Search
Volume19
Issue number1
DOIs
StatePublished - 2026
Event19th 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