{"id":"https://openalex.org/W7161590865","doi":"https://doi.org/10.48550/arxiv.2605.15983","title":"Petri Net Induced Heuristic Search for Resource Constrained Scheduling","display_name":"Petri Net Induced Heuristic Search for Resource Constrained Scheduling","publication_year":2026,"publication_date":"2026-05-15","ids":{"openalex":"https://openalex.org/W7161590865","doi":"https://doi.org/10.48550/arxiv.2605.15983"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.15983","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.15983","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.15983","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5136368196","display_name":"Ido Lublin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lublin, Ido","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025220652","display_name":"Dor Atzmon","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Atzmon, Dor","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5041097802","display_name":"Izack Cohen","orcid":"https://orcid.org/0000-0002-6775-3256"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Cohen, Izack","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.967199981212616,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.967199981212616,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11125","display_name":"Petri Nets in System Modeling","score":0.012199999764561653,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.0038999998942017555,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/petri-net","display_name":"Petri net","score":0.7936999797821045},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.7732999920845032},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5978000164031982},{"id":"https://openalex.org/keywords/critical-path-method","display_name":"Critical path method","score":0.5867000222206116},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5605999827384949},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5005000233650208},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4505000114440918},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.40630000829696655},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.39969998598098755}],"concepts":[{"id":"https://openalex.org/C38677869","wikidata":"https://www.wikidata.org/wiki/Q724168","display_name":"Petri net","level":2,"score":0.7936999797821045},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.7732999920845032},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6797000169754028},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5978000164031982},{"id":"https://openalex.org/C115874739","wikidata":"https://www.wikidata.org/wiki/Q825377","display_name":"Critical path method","level":2,"score":0.5867000222206116},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5773000121116638},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5605999827384949},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5005000233650208},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4505000114440918},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40630000829696655},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.39969998598098755},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.3808000087738037},{"id":"https://openalex.org/C197551870","wikidata":"https://www.wikidata.org/wiki/Q7617809","display_name":"Stochastic Petri net","level":3,"score":0.3765000104904175},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.3407999873161316},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.3190000057220459},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.29829999804496765},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2879999876022339},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.28529998660087585},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.2840999960899353},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.27970001101493835},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.27730000019073486},{"id":"https://openalex.org/C200246849","wikidata":"https://www.wikidata.org/wiki/Q5163226","display_name":"Consistent heuristic","level":5,"score":0.27469998598098755},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.2718999981880188},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.27160000801086426},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.25780001282691956},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.25609999895095825},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.2531000077724457}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.15983","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.15983","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.15983","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.15983","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,39],"formulate":[1],"the":[2,12,35,41,71,76],"Resource-Constrained":[3],"Project":[4],"Scheduling":[5],"Problem":[6],"(RCPSP)":[7],"as":[8],"optimal":[9],"search":[10,100],"over":[11],"reachability":[13],"graph":[14],"of":[15],"a":[16,48],"Timed":[17],"Transition":[18],"Petri":[19],"Net":[20],"with":[21,44,116],"Resources,":[22],"using":[23],"relative-delay":[24],"tokens":[25],"so":[26],"that":[27,50,60,75,98],"scheduling":[28],"decisions":[29],"correspond":[30],"to":[31],"transition":[32],"firings":[33],"in":[34,88],"induced":[36],"state":[37],"space.":[38],"solve":[40,93],"resulting":[42],"problem":[43],"$A^*$":[45,110],"guided":[46],"by":[47],"heuristic":[49,99],"combines":[51],"Critical":[52],"Path":[53],"and":[54,58,92,101,111],"resource-based":[55],"lower":[56],"bounds,":[57],"prove":[59],"it":[61],"is":[62],"consistent":[63],"under":[64],"our":[65],"token-based":[66],"time":[67],"semantics.":[68],"Experiments":[69],"on":[70],"PSPLIB":[72],"benchmarks":[73],"show":[74],"approach":[77],"outperforms":[78],"strong":[79],"exact":[80],"Mixed-Integer":[81],"Linear":[82],"Programming":[83],"(MIP)":[84],"baselines":[85],"(SCIP,":[86],"CBC)":[87],"both":[89],"success":[90],"rate":[91],"time.":[94],"Per-instance":[95],"analysis":[96],"shows":[97],"MIP":[102],"degrade":[103],"along":[104],"independent":[105],"axes,":[106],"resource":[107,117],"tightness":[108],"for":[109,114],"formulation":[112],"size":[113],"MIP,":[115],"strength":[118],"mediating":[119],"which":[120],"solver":[121],"benefits":[122],"from":[123],"scale.":[124]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-05-19T00:00:00"}