{"id":"https://openalex.org/W3035705090","doi":"https://doi.org/10.24963/ijcai.2020/241","title":"The Complexity Landscape of Resource-Constrained Scheduling","display_name":"The Complexity Landscape of Resource-Constrained Scheduling","publication_year":2020,"publication_date":"2020-07-01","ids":{"openalex":"https://openalex.org/W3035705090","doi":"https://doi.org/10.24963/ijcai.2020/241","mag":"3035705090"},"language":"en","primary_location":{"id":"doi:10.24963/ijcai.2020/241","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2020/241","pdf_url":"https://www.ijcai.org/proceedings/2020/0241.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.ijcai.org/proceedings/2020/0241.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5088116512","display_name":"Robert Ganian","orcid":"https://orcid.org/0000-0002-7762-8045"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Robert Ganian","raw_affiliation_strings":["Vienna University of Technology"],"affiliations":[{"raw_affiliation_string":"Vienna University of Technology","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034753800","display_name":"Thekla Hamm","orcid":"https://orcid.org/0000-0002-4595-9982"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Thekla Hamm","raw_affiliation_strings":["Vienna University of Technology"],"affiliations":[{"raw_affiliation_string":"Vienna University of Technology","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074657200","display_name":"Guillaume Mescoff","orcid":null},"institutions":[{"id":"https://openalex.org/I3124938446","display_name":"Universit\u00e9 Rennes 2","ror":"https://ror.org/01m84wm78","country_code":"FR","type":"education","lineage":["https://openalex.org/I3124938446"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Guillaume Mescoff","raw_affiliation_strings":["Rennes University"],"affiliations":[{"raw_affiliation_string":"Rennes University","institution_ids":["https://openalex.org/I3124938446"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5088116512"],"corresponding_institution_ids":["https://openalex.org/I145847075"],"apc_list":null,"apc_paid":null,"fwci":1.3,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.82322625,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1741","last_page":"1747"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.9998000264167786,"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.9998000264167786,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9958000183105469,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11159","display_name":"Manufacturing Process and Optimization","score":0.9377999901771545,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6632909774780273},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5300260186195374},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.5290184020996094},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5215737223625183},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4861581027507782},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4852125942707062},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.45691969990730286},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.45377546548843384},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.42410194873809814},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4148106575012207},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3961959481239319},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.38076189160346985},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26753169298171997},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2551040053367615}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6632909774780273},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5300260186195374},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.5290184020996094},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5215737223625183},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4861581027507782},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4852125942707062},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.45691969990730286},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.45377546548843384},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.42410194873809814},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4148106575012207},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3961959481239319},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.38076189160346985},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26753169298171997},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2551040053367615},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.24963/ijcai.2020/241","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2020/241","pdf_url":"https://www.ijcai.org/proceedings/2020/0241.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.24963/ijcai.2020/241","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2020/241","pdf_url":"https://www.ijcai.org/proceedings/2020/0241.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1975729292","display_name":null,"funder_award_id":"W1255-N23","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G8159133586","display_name":null,"funder_award_id":"P31336","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G8680849391","display_name":null,"funder_award_id":"W1255","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"}],"funders":[{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3035705090.pdf","grobid_xml":"https://content.openalex.org/works/W3035705090.grobid-xml"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W134426750","https://openalex.org/W189263161","https://openalex.org/W1553361062","https://openalex.org/W1598982666","https://openalex.org/W1989556004","https://openalex.org/W2011039300","https://openalex.org/W2021183451","https://openalex.org/W2024742034","https://openalex.org/W2057913648","https://openalex.org/W2066447358","https://openalex.org/W2067801697","https://openalex.org/W2091648513","https://openalex.org/W2095381673","https://openalex.org/W2102925520","https://openalex.org/W2116087731","https://openalex.org/W2190561388","https://openalex.org/W2276396643","https://openalex.org/W2313886575","https://openalex.org/W2340474360","https://openalex.org/W2345511458","https://openalex.org/W2403178671","https://openalex.org/W2548740804","https://openalex.org/W2577092713","https://openalex.org/W2605044236","https://openalex.org/W2748379985","https://openalex.org/W2782564847","https://openalex.org/W2811361556","https://openalex.org/W2914414140","https://openalex.org/W2962877422"],"related_works":["https://openalex.org/W4394650907","https://openalex.org/W154364797","https://openalex.org/W4254119641","https://openalex.org/W3196207352","https://openalex.org/W2951724202","https://openalex.org/W3084261076","https://openalex.org/W2576399385","https://openalex.org/W2963408011","https://openalex.org/W4236324517","https://openalex.org/W961142965"],"abstract_inverted_index":{"The":[0],"Resource-Constrained":[1],"Project":[2],"Scheduling":[3],"Problem":[4],"(RCPSP)":[5],"and":[6,62,92],"its":[7],"extension":[8],"via":[9],"activity":[10],"modes":[11],"(MRCPSP)":[12],"are":[13],"well-established":[14],"scheduling":[15],"frameworks":[16,42],"that":[17,105,153],"have":[18,58],"found":[19],"numerous":[20],"applications":[21],"in":[22,40,95,118,139,174],"a":[23,37,51,99,158,167],"broad":[24],"range":[25],"of":[26,35,65,68,74,77,85,103,109,114,120,123,126,141,144,157],"settings":[27],"related":[28],"to":[29,45,97,134],"artificial":[30],"intelligence.":[31],"Unsurprisingly,":[32],"the":[33,66,69,72,78,82,107,115,129,142,155],"problem":[34,116],"finding":[36],"suitable":[38],"schedule":[39],"these":[41],"is":[43,164],"known":[44],"be":[46],"NP-complete;":[47],"however,":[48],"aside":[49],"from":[50,71],"few":[52],"results":[53],"for":[54],"special":[55],"cases,":[56],"we":[57,88,132,151,170],"lacked":[59],"an":[60],"in-depth":[61],"comprehensive":[63],"understanding":[64],"complexity":[67,101,108,143],"problems":[70],"viewpoint":[73],"natural":[75,124],"restrictions":[76,122,137],"considered":[79,112],"instances.":[80,127],"In":[81,128,149],"first":[83],"part":[84],"our":[86],"paper,":[87],"develop":[89],"new":[90],"algorithms":[91],"give":[93],"hardness-proofs":[94],"order":[96],"obtain":[98],"detailed":[100],"map":[102],"(M)RCPSP":[104],"settles":[106],"all":[110],"1024":[111],"variants":[113],"defined":[117,138],"terms":[119,140],"explicit":[121],"parameters":[125],"second":[130],"part,":[131],"turn":[133],"implicit":[135],"structural":[136],"interactions":[145,163],"between":[146],"individual":[147],"activities.":[148],"particular,":[150],"show":[152],"if":[154],"treewidth":[156],"graph":[159],"which":[160],"captures":[161],"such":[162],"bounded":[165],"by":[166],"constant,":[168],"then":[169],"can":[171],"solve":[172],"MRCPSP":[173],"polynomial":[175],"time.":[176]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}