{"id":"https://openalex.org/W2891426835","doi":"https://doi.org/10.1080/00207543.2018.1504245","title":"A novel branch-and-bound algorithm for the chance-constrained resource-constrained project scheduling problem","display_name":"A novel branch-and-bound algorithm for the chance-constrained resource-constrained project scheduling problem","publication_year":2018,"publication_date":"2018-09-20","ids":{"openalex":"https://openalex.org/W2891426835","doi":"https://doi.org/10.1080/00207543.2018.1504245","mag":"2891426835"},"language":"en","primary_location":{"id":"doi:10.1080/00207543.2018.1504245","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207543.2018.1504245","pdf_url":null,"source":{"id":"https://openalex.org/S65690446","display_name":"International Journal of Production Research","issn_l":"0020-7543","issn":["0020-7543","1366-588X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Production Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://lirias.kuleuven.be/handle/123456789/624905","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5038066196","display_name":"Morteza Davari","orcid":"https://orcid.org/0000-0002-7093-0946"},"institutions":[{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":true,"raw_author_name":"Morteza Davari","raw_affiliation_strings":["Department of Decision Sciences and Information Management, KU Leuven, Leuven, Belgium"],"raw_orcid":"https://orcid.org/0000-0002-7093-0946","affiliations":[{"raw_affiliation_string":"Department of Decision Sciences and Information Management, KU Leuven, Leuven, Belgium","institution_ids":["https://openalex.org/I99464096"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022083734","display_name":"Erik Demeulemeester","orcid":"https://orcid.org/0000-0001-7799-6510"},"institutions":[{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Erik Demeulemeester","raw_affiliation_strings":["Department of Decision Sciences and Information Management, KU Leuven, Leuven, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Decision Sciences and Information Management, KU Leuven, Leuven, Belgium","institution_ids":["https://openalex.org/I99464096"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5038066196"],"corresponding_institution_ids":["https://openalex.org/I99464096"],"apc_list":null,"apc_paid":null,"fwci":2.5476,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.9013106,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"57","issue":"4","first_page":"1265","last_page":"1282"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12177","display_name":"Resource-Constrained Project Scheduling","score":1.0,"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":1.0,"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.9901000261306763,"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/T10395","display_name":"Construction Project Management and Performance","score":0.9800999760627747,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7170679569244385},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.7010641098022461},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.6176326870918274},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5980554223060608},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5712483525276184},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5533369779586792},{"id":"https://openalex.org/keywords/resource-constraints","display_name":"Resource constraints","score":0.4624841809272766},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4295705258846283},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.4284853935241699},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34865662455558777},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28970304131507874},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.07860001921653748}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7170679569244385},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.7010641098022461},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6176326870918274},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5980554223060608},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5712483525276184},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5533369779586792},{"id":"https://openalex.org/C3017813396","wikidata":"https://www.wikidata.org/wiki/Q17078173","display_name":"Resource constraints","level":2,"score":0.4624841809272766},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4295705258846283},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.4284853935241699},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34865662455558777},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28970304131507874},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.07860001921653748},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1080/00207543.2018.1504245","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207543.2018.1504245","pdf_url":null,"source":{"id":"https://openalex.org/S65690446","display_name":"International Journal of Production Research","issn_l":"0020-7543","issn":["0020-7543","1366-588X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Production Research","raw_type":"journal-article"},{"id":"pmh:oai:lirias2repo.kuleuven.be:123456789/624905","is_oa":true,"landing_page_url":"https://lirias.kuleuven.be/handle/123456789/624905","pdf_url":null,"source":{"id":"https://openalex.org/S7407055369","display_name":"Lirias","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"International Journal Of Production Research, vol. 57 (4), (1265-1282)","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:RePEc:taf:tprsxx:v:57:y:2019:i:4:p:1265-1282","is_oa":false,"landing_page_url":"http://hdl.handle.net/10.1080/00207543.2018.1504245","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},{"id":"pmh:oai:figshare.com:article/7111079","is_oa":true,"landing_page_url":"https://figshare.com/articles/journal_contribution/A_novel_branch-and-bound_algorithm_for_the_chance-constrained_resource-constrained_project_scheduling_problem/7111079","pdf_url":null,"source":{"id":"https://openalex.org/S4306402621","display_name":"INDIGO (University of Illinois at Chicago)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I39422238","host_organization_name":"University of Illinois Chicago","host_organization_lineage":["https://openalex.org/I39422238"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},{"id":"doi:10.6084/m9.figshare.7111079.v1","is_oa":true,"landing_page_url":"https://doi.org/10.6084/m9.figshare.7111079.v1","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"pmh:oai:lirias2repo.kuleuven.be:123456789/624905","is_oa":true,"landing_page_url":"https://lirias.kuleuven.be/handle/123456789/624905","pdf_url":null,"source":{"id":"https://openalex.org/S7407055369","display_name":"Lirias","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"International Journal Of Production Research, vol. 57 (4), (1265-1282)","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W47253493","https://openalex.org/W130750258","https://openalex.org/W178659373","https://openalex.org/W1964195749","https://openalex.org/W1973131489","https://openalex.org/W1989755892","https://openalex.org/W1995068753","https://openalex.org/W1995670718","https://openalex.org/W2004572554","https://openalex.org/W2006347382","https://openalex.org/W2007668370","https://openalex.org/W2011991819","https://openalex.org/W2012389735","https://openalex.org/W2016007273","https://openalex.org/W2024742034","https://openalex.org/W2038344153","https://openalex.org/W2041977479","https://openalex.org/W2044572576","https://openalex.org/W2072730699","https://openalex.org/W2077371113","https://openalex.org/W2092425721","https://openalex.org/W2106622621","https://openalex.org/W2143514150","https://openalex.org/W2148748601","https://openalex.org/W2151140685","https://openalex.org/W2153864093","https://openalex.org/W2168348515","https://openalex.org/W2171761463","https://openalex.org/W2240441253","https://openalex.org/W2396061533","https://openalex.org/W2499851402","https://openalex.org/W2523575881","https://openalex.org/W2544662496","https://openalex.org/W2583396165","https://openalex.org/W2588959171","https://openalex.org/W2789380436","https://openalex.org/W3123122793","https://openalex.org/W3124522424","https://openalex.org/W3150323996","https://openalex.org/W4205273217","https://openalex.org/W6904734965"],"related_works":["https://openalex.org/W2009796757","https://openalex.org/W1968202374","https://openalex.org/W2008600006","https://openalex.org/W2084616826","https://openalex.org/W1971357083","https://openalex.org/W2734758384","https://openalex.org/W1595394363","https://openalex.org/W2354460058","https://openalex.org/W125276123","https://openalex.org/W3153884794"],"abstract_inverted_index":{"The":[0,35,95],"resource-constrained":[1,37],"project":[2,38],"scheduling":[3,39],"problem":[4,40],"(RCPSP)":[5],"has":[6,42],"been":[7,43],"widely":[8],"studied":[9],"during":[10],"the":[11,51,77,91,100,116],"last":[12],"few":[13],"decades.":[14],"In":[15,53],"real-world":[16],"projects,":[17],"however,":[18],"not":[19],"all":[20],"information":[21],"is":[22,28],"known":[23],"in":[24,50],"advance":[25],"and":[26,62,85,111],"uncertainty":[27,49],"an":[29],"inevitable":[30],"part":[31],"of":[32,76],"these":[33],"projects.":[34],"chance-constrained":[36],"(CC-RCPSP)":[41],"recently":[44],"introduced":[45],"to":[46],"deal":[47],"with":[48],"RCPSP.":[52],"this":[54],"paper,":[55],"we":[56],"propose":[57],"a":[58,63,72,107,112],"branch-and-bound":[59],"(B&B)":[60],"algorithm":[61,114],"mixed":[64],"integer":[65],"linear":[66],"programming":[67],"(MILP)":[68],"formulation":[69,110],"that":[70,99],"solve":[71],"sample":[73],"average":[74],"approximation":[75],"CC-RCPSP.":[78],"We":[79],"introduce":[80],"two":[81],"different":[82,87],"branching":[83],"schemes":[84],"eight":[86],"priority":[88],"rules":[89],"for":[90],"proposed":[92,101,108],"B&B":[93,102],"algorithm.":[94],"computational":[96],"results":[97],"suggest":[98],"procedure":[103],"clearly":[104],"outperforms":[105],"both":[106],"MILP":[109],"branch-and-cut":[113],"from":[115],"literature.":[117]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}