Petri Net Induced Heuristic Search for Resource Constrained Scheduling
The article presents a new approach to the Resource-Constrained Project Scheduling Problem (RCPSP) using a Timed Transition Petri Net. The authors demonstrate that their heuristic search method outperforms traditional Mixed-Integer Linear Programming baselines in both success rate and solve time. This research was accepted at the International Symposium on Combinatorial Search in 2026.
- ▪The study formulates RCPSP as optimal search over the reachability graph of a Timed Transition Petri Net.
- ▪The proposed method uses A* guided by a heuristic that combines Critical Path and resource-based lower bounds.
- ▪Experiments show that the approach outperforms strong exact MIP baselines in success rate and solve time.
arXiv cs.AI files mainly under ai research. We currently carry 1,128 of its stories.
Story provenance
Source · retrieval · rights · ranking — open for full record
inspect →
Story provenance
Attribution is not the same as permission. This drawer separates discovery metadata, excerpts, WeSearch-generated summaries, reuse status, and whether the publisher receives the visit. Nothing here claims a legal grant the publisher has not made.
Record
| Original publisher | arXiv cs.AI |
| Canonical URL | https://arxiv.org/abs/2605.15983 |
| Publication time | Mon, 18 May 2026 00:00:00 -0400 |
| Retrieval time | 2026-05-18T04:04:54.418Z |
| Last seen | 2026-05-18T04:04:54.418Z |
| Headline source | Publisher (no WeSearch rewrite) |
| Excerpt source | publisher body |
| Excerpt method | First ~120 words (~800 chars) of extracted publisher body, fair-use limited. |
| Summary | WeSearch · cerebras-chat (WeSearch summarizer) |
| Summary source text | contentText |
| Citation coverage | Summary is a WeSearch-generated derivative; primary citation is the original publisher URL. |
| Cluster | VwSDlI8niEae |
| Cluster logic | Grouped by semantic title/content similarity across sources within a rolling window. Same-publisher template collisions are excluded from coverage comparison. |
| Ranking reason | Story pages are not engagement-ranked. Hub feeds use recency, with optional source-diversified chronological ordering (cap consecutive stories per source). No personalized ranking. |
| Publisher visit | Yes — open original |
| Substitutes article? | No — link-out required for full text |
Rights status (four layers)
WeSearch handling by dimension
| Indexing | May the item be indexed (stored, ranked, made findable)? | Allowed |
| Snippet | May a short excerpt of the publisher's text be shown? | Allowed |
| AI summary | May WeSearch generate its own short summary of the article? | Limited |
| Retrieval / RAG | May the content be exposed for third-party retrieval-augmented generation? | Not asserted |
| Model training | May the content be used to train AI models? | Not asserted |
| Commercial reuse | May the content be reused commercially? | Not permitted |
Basis: Derived from the published RSS/Atom feed. Contact: [email protected]. Reviewed: 2026-07-24.
Opening excerpt (first ~120 words) tap to expand
Computer Science > Artificial Intelligence arXiv:2605.15983 (cs) [Submitted on 15 May 2026] Title:Petri Net Induced Heuristic Search for Resource Constrained Scheduling Authors:Ido Lublin, Dor Atzmon, Izack Cohen View a PDF of the paper titled Petri Net Induced Heuristic Search for Resource Constrained Scheduling, by Ido Lublin and 2 other authors View PDF HTML (experimental) 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.
…
Excerpt limited to ~120 words for fair-use compliance. The full article is at arXiv cs.AI.
Discussion
0 commentsMore from arXiv cs.AI
