{"id":"https://openalex.org/W2100413810","doi":"https://doi.org/10.1109/tem.2010.2063707","title":"Project-Scheduling Problem With Random Time-Dependent Activity Duration Times","display_name":"Project-Scheduling Problem With Random Time-Dependent Activity Duration Times","publication_year":2010,"publication_date":"2010-09-29","ids":{"openalex":"https://openalex.org/W2100413810","doi":"https://doi.org/10.1109/tem.2010.2063707","mag":"2100413810"},"language":"en","primary_location":{"id":"doi:10.1109/tem.2010.2063707","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tem.2010.2063707","pdf_url":null,"source":{"id":"https://openalex.org/S154533451","display_name":"IEEE Transactions on Engineering Management","issn_l":"0018-9391","issn":["0018-9391","1558-0040"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Engineering Management","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"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/A5101748860","display_name":"Wei Huang","orcid":"https://orcid.org/0000-0002-4315-8487"},"institutions":[{"id":"https://openalex.org/I37461747","display_name":"Wuhan University","ror":"https://ror.org/033vjfk17","country_code":"CN","type":"education","lineage":["https://openalex.org/I37461747"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Wei Huang","raw_affiliation_strings":["State Key Laboratory of Software Engineering, Wuhan University of China, Wuhan, China","State Key Lab of Software Engineering, Wuhan University, Wuhan, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"State Key Laboratory of Software Engineering, Wuhan University of China, Wuhan, China","institution_ids":["https://openalex.org/I37461747"]},{"raw_affiliation_string":"State Key Lab of Software Engineering, Wuhan University, Wuhan, China","institution_ids":["https://openalex.org/I37461747"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100829152","display_name":"Lixin Ding","orcid":null},"institutions":[{"id":"https://openalex.org/I37461747","display_name":"Wuhan University","ror":"https://ror.org/033vjfk17","country_code":"CN","type":"education","lineage":["https://openalex.org/I37461747"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Lixin Ding","raw_affiliation_strings":["State Key Laboratory of Software Engineering, Wuhan University of China, Wuhan, China","State Key Lab of Software Engineering, Wuhan University, Wuhan, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"State Key Laboratory of Software Engineering, Wuhan University of China, Wuhan, China","institution_ids":["https://openalex.org/I37461747"]},{"raw_affiliation_string":"State Key Lab of Software Engineering, Wuhan University, Wuhan, China","institution_ids":["https://openalex.org/I37461747"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I37461747"],"apc_list":null,"apc_paid":null,"fwci":3.9343,"has_fulltext":false,"cited_by_count":42,"citation_normalized_percentile":{"value":0.93488861,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"58","issue":"2","first_page":"377","last_page":"387"},"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9948999881744385,"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/critical-path-method","display_name":"Critical path method","score":0.7468932867050171},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6576101183891296},{"id":"https://openalex.org/keywords/randomness","display_name":"Randomness","score":0.6569132208824158},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6411042213439941},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.5709012150764465},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5357104539871216},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.5155308246612549},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.5109276175498962},{"id":"https://openalex.org/keywords/duration","display_name":"Duration (music)","score":0.4546038508415222},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4394264221191406},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.43084245920181274},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.2120775580406189},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20024409890174866},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.188468337059021},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.10837206244468689}],"concepts":[{"id":"https://openalex.org/C115874739","wikidata":"https://www.wikidata.org/wiki/Q825377","display_name":"Critical path method","level":2,"score":0.7468932867050171},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6576101183891296},{"id":"https://openalex.org/C125112378","wikidata":"https://www.wikidata.org/wiki/Q176640","display_name":"Randomness","level":2,"score":0.6569132208824158},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6411042213439941},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5709012150764465},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5357104539871216},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.5155308246612549},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.5109276175498962},{"id":"https://openalex.org/C112758219","wikidata":"https://www.wikidata.org/wiki/Q16038819","display_name":"Duration (music)","level":2,"score":0.4546038508415222},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4394264221191406},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.43084245920181274},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.2120775580406189},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20024409890174866},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.188468337059021},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.10837206244468689},{"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/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tem.2010.2063707","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tem.2010.2063707","pdf_url":null,"source":{"id":"https://openalex.org/S154533451","display_name":"IEEE Transactions on Engineering Management","issn_l":"0018-9391","issn":["0018-9391","1558-0040"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Engineering Management","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W30338732","https://openalex.org/W53584479","https://openalex.org/W1639032689","https://openalex.org/W1973131489","https://openalex.org/W1973661097","https://openalex.org/W1979291456","https://openalex.org/W1988737128","https://openalex.org/W1994635176","https://openalex.org/W2031967357","https://openalex.org/W2049606892","https://openalex.org/W2058164800","https://openalex.org/W2062205222","https://openalex.org/W2065342991","https://openalex.org/W2087389868","https://openalex.org/W2093510796","https://openalex.org/W2115817268","https://openalex.org/W2116548865","https://openalex.org/W2128530362","https://openalex.org/W2128597279","https://openalex.org/W2133737493","https://openalex.org/W2138706783","https://openalex.org/W2139165602","https://openalex.org/W2142352947","https://openalex.org/W2152430596","https://openalex.org/W2208187587","https://openalex.org/W2338905098","https://openalex.org/W2418206028","https://openalex.org/W2612487376","https://openalex.org/W2613344871","https://openalex.org/W2751593060","https://openalex.org/W3023540311","https://openalex.org/W3140227716","https://openalex.org/W3143971390","https://openalex.org/W3174732519","https://openalex.org/W4285719527","https://openalex.org/W6602131065","https://openalex.org/W6717532162"],"related_works":["https://openalex.org/W4236295709","https://openalex.org/W2183022234","https://openalex.org/W2530969325","https://openalex.org/W2063960857","https://openalex.org/W2520902986","https://openalex.org/W2054252874","https://openalex.org/W2144127568","https://openalex.org/W2907145845","https://openalex.org/W2167791430","https://openalex.org/W2100413810"],"abstract_inverted_index":{"In":[0],"this":[1,109],"paper,":[2],"we":[3,61,82,94],"introduce":[4],"a":[5,49],"random":[6],"time-dependent":[7],"project":[8],"-scheduling":[9],"problem":[10],"(RTPSP),":[11],"in":[12,143],"which":[13],"activity":[14],"duration":[15],"times":[16],"are":[17,74,114,150],"represented":[18],"as":[19,21,23],"randomness":[20],"well":[22],"time":[24],"dependence.":[25],"Under":[26],"these":[27],"circumstances,":[28],"the":[29,46,58,70,88,96,134,144,154,157],"resulting":[30],"RTPSP":[31,97],"is":[32,129],"far":[33],"more":[34],"complex":[35],"when":[36,52],"compared":[37],"with":[38,54],"existing":[39],"project-scheduling":[40,55,146],"problems.":[41,56,147],"The":[42,111],"complexity":[43],"stems":[44],"identifying":[45],"critical":[47,59,89],"path,":[48,60],"core":[50],"issue":[51],"dealing":[53],"Considering":[57],"first":[62],"show":[63],"that":[64,118,139],"using":[65],"\u201cstandard\u201d":[66],"path":[67,90],"algorithms":[68],"(e.g.,":[69],"well-known":[71],"Dijkstra":[72],"method)":[73],"not":[75,141],"able":[76],"to":[77,103,132,152],"arrive":[78],"at":[79],"solutions.":[80],"Subsequently,":[81],"propose":[83],"an":[84],"approach":[85],"of":[86,91,121,136,156],"handling":[87],"RTPSP.":[92],"Next,":[93],"formulate":[95],"and":[98,124],"present":[99],"three":[100],"stochastic-programming":[101],"models":[102,113],"address":[104],"various":[105],"requirements":[106],"arising":[107],"within":[108],"framework.":[110],"proposed":[112],"handled":[115],"through":[116],"techniques":[117],"combine":[119],"mechanisms":[120],"stochastic":[122],"simulation":[123,128],"genetic":[125],"optimization.":[126],"Stochastic":[127],"exploited":[130],"here":[131],"estimate":[133],"value":[135],"uncertain":[137],"functions":[138],"do":[140],"exist":[142],"general":[145],"Numerical":[148],"experiments":[149],"used":[151],"illustrate":[153],"effectiveness":[155],"algorithm.":[158]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}