{"id":"https://openalex.org/W198923957","doi":null,"title":"Complete MCS-based search: application to resource constrained project scheduling","display_name":"Complete MCS-based search: application to resource constrained project scheduling","publication_year":2005,"publication_date":"2005-07-30","ids":{"openalex":"https://openalex.org/W198923957","mag":"198923957"},"language":"en","primary_location":{"id":"mag:198923957","doi":null,"is_oa":false,"landing_page_url":"http://ijcai.org/Proceedings/05/Papers/0571.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306419999","display_name":"International Joint Conference on Artificial Intelligence","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"International Joint Conference on Artificial Intelligence","raw_type":null},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5035849846","display_name":"Philippe Laborie","orcid":"https://orcid.org/0000-0002-4045-8601","observed_orcids":["https://orcid.org/0000-0002-4045-8601"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Philippe Laborie","raw_affiliation_strings":["ILOG, Gentilly Cedex, France#TAB#"],"raw_orcid":"https://orcid.org/0000-0002-4045-8601","affiliations":[{"raw_affiliation_string":"ILOG, Gentilly Cedex, France#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5035849846"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":12.2304,"has_fulltext":false,"cited_by_count":69,"citation_normalized_percentile":{"value":0.98689575,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"181","last_page":"186"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.48019999265670776,"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.48019999265670776,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.46459999680519104,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.03739999979734421,"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/cumulative-scheduling","display_name":"cumulative scheduling","score":0.7870000004768372},{"id":"https://openalex.org/keywords/resource-constrained-project-scheduling-problem","display_name":"resource-constrained project scheduling","score":0.9520000219345093},{"id":"https://openalex.org/keywords/complete-search","display_name":"complete search","score":0.8709999918937683},{"id":"https://openalex.org/keywords/constraint-propagation","display_name":"constraint propagation","score":0.7799999713897705},{"id":"https://openalex.org/keywords/search-space-reduction","display_name":"search space reduction","score":0.7120000123977661},{"id":"https://openalex.org/keywords/psplib","display_name":"PSPLIB","score":0.5870000123977661},{"id":"https://openalex.org/keywords/open-shop-scheduling","display_name":"open shop scheduling","score":0.8410000205039978},{"id":"https://openalex.org/keywords/lower-bounds","display_name":"lower bounds","score":0.953000009059906}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6337133646011353},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6032292246818542},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5922311544418335},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5405797362327576},{"id":"https://openalex.org/C3017813396","wikidata":"https://www.wikidata.org/wiki/Q17078173","display_name":"Resource constraints","level":2,"score":0.4793201684951782},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.4762461483478546},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.4583439826965332},{"id":"https://openalex.org/C90189156","wikidata":"https://www.wikidata.org/wiki/Q5615481","display_name":"Guided Local Search","level":3,"score":0.4217681288719177},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.408674031496048},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3343355655670166},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22430011630058289},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.21699216961860657},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.16389408707618713},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:198923957","doi":null,"is_oa":false,"landing_page_url":"http://ijcai.org/Proceedings/05/Papers/0571.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306419999","display_name":"International Joint Conference on Artificial Intelligence","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"International Joint Conference on Artificial Intelligence","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W108408365","https://openalex.org/W203152144","https://openalex.org/W1528419757","https://openalex.org/W1544457345","https://openalex.org/W1964701519","https://openalex.org/W1973131489","https://openalex.org/W2015241450","https://openalex.org/W2029319864","https://openalex.org/W2090923074","https://openalex.org/W2118363183","https://openalex.org/W2121852392","https://openalex.org/W2168328014","https://openalex.org/W4243432816"],"related_works":["https://openalex.org/W1545739297","https://openalex.org/W2028327036","https://openalex.org/W73466379","https://openalex.org/W2129256434","https://openalex.org/W7026287805","https://openalex.org/W7097196123","https://openalex.org/W7161590865","https://openalex.org/W2168997162","https://openalex.org/W2265211508","https://openalex.org/W2377174513"],"abstract_inverted_index":{"This":[0],"paper":[1],"describes":[2],"a":[3],"simple":[4],"complete":[5],"search":[6,36,42],"for":[7,23],"cumulative":[8,111],"scheduling":[9,66,113],"based":[10],"on":[11,27,53,62,100,108],"the":[12,31,35,41,78,83,95],"detection":[13],"and":[14,60,86,89,110],"resolution":[15],"of":[16,30,34,40,55,77,82,94],"minimal":[17],"critical":[18],"sets":[19],"(MCS).":[20],"The":[21,49],"heuristic":[22],"selecting":[24],"MCSs":[25],"relies":[26],"an":[28],"estimation":[29],"related":[32],"reduction":[33],"space.":[37],"An":[38],"extension":[39],"procedure":[43],"using":[44],"self-adapting":[45],"shaving":[46],"is":[47],"proposed.":[48],"approach":[50],"was":[51],"implemented":[52],"top":[54],"classical":[56],"constraint":[57],"propagation":[58],"algorithms":[59],"tested":[61],"resource":[63],"constrained":[64],"project":[65],"problems":[67,81],"(RCPSP).":[68],"We":[69],"were":[70],"able":[71],"to":[72],"close":[73],"more":[74,91],"than":[75,92],"15%":[76],"previously":[79],"open":[80],"PSPLIB":[84],"[Kolisch":[85],"Sprecher,":[87],"1996]":[88],"improve":[90],"31%":[93],"best":[96],"known":[97],"lower":[98],"bounds":[99],"those":[101],"heavily":[102],"studied":[103],"problems.":[104],"Other":[105],"new":[106],"results":[107],"open-shop":[109],"job-shop":[112],"are":[114],"reported.":[115]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":2}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}