{"id":"https://openalex.org/W2523761909","doi":"https://doi.org/10.3390/a9040063","title":"A Practical and Robust Execution Time-Frame Procedure for the Multi-Mode Resource-Constrained Project Scheduling Problem with Minimal and Maximal Time Lags","display_name":"A Practical and Robust Execution Time-Frame Procedure for the Multi-Mode Resource-Constrained Project Scheduling Problem with Minimal and Maximal Time Lags","publication_year":2016,"publication_date":"2016-09-24","ids":{"openalex":"https://openalex.org/W2523761909","doi":"https://doi.org/10.3390/a9040063","mag":"2523761909"},"language":"en","primary_location":{"id":"doi:10.3390/a9040063","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a9040063","pdf_url":"https://www.mdpi.com/1999-4893/9/4/63/pdf?version=1474717579","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/9/4/63/pdf?version=1474717579","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5113585798","display_name":"Angela Chen","orcid":null},"institutions":[{"id":"https://openalex.org/I4210105356","display_name":"Nanya Technology (Taiwan)","ror":"https://ror.org/029rcz204","country_code":"TW","type":"company","lineage":["https://openalex.org/I4210105356"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Angela Chen","raw_affiliation_strings":["Department of Marketing and Distribution Management, Nanya Institute of Technology, Taoyuan 32091, Taiwan"],"affiliations":[{"raw_affiliation_string":"Department of Marketing and Distribution Management, Nanya Institute of Technology, Taoyuan 32091, Taiwan","institution_ids":["https://openalex.org/I4210105356"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082345507","display_name":"Yun-Chia Liang","orcid":"https://orcid.org/0000-0002-0375-0830"},"institutions":[{"id":"https://openalex.org/I99908691","display_name":"Yuan Ze University","ror":"https://ror.org/01fv1ds98","country_code":"TW","type":"education","lineage":["https://openalex.org/I99908691"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Yun-Chia Liang","raw_affiliation_strings":["Department of Industrial Engineering and Management, Yuan Ze University, Taoyuan 32003, Taiwan","Innovation Center for Big Data and Digital Convergence, Yuan Ze University, Taoyuan 32003, Taiwan"],"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering and Management, Yuan Ze University, Taoyuan 32003, Taiwan","institution_ids":["https://openalex.org/I99908691"]},{"raw_affiliation_string":"Innovation Center for Big Data and Digital Convergence, Yuan Ze University, Taoyuan 32003, Taiwan","institution_ids":["https://openalex.org/I99908691"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112217083","display_name":"Jose Padilla","orcid":null},"institutions":[{"id":"https://openalex.org/I99908691","display_name":"Yuan Ze University","ror":"https://ror.org/01fv1ds98","country_code":"TW","type":"education","lineage":["https://openalex.org/I99908691"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Jose Padilla","raw_affiliation_strings":["Department of Industrial Engineering and Management, Yuan Ze University, Taoyuan 32003, Taiwan"],"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering and Management, Yuan Ze University, Taoyuan 32003, Taiwan","institution_ids":["https://openalex.org/I99908691"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5113585798"],"corresponding_institution_ids":["https://openalex.org/I4210105356"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.3591,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.70720427,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"9","issue":"4","first_page":"63","last_page":"63"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.9998999834060669,"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.9998999834060669,"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.9879999756813049,"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/T13886","display_name":"Operations Management Techniques","score":0.9696999788284302,"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/computer-science","display_name":"Computer science","score":0.754889726638794},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6427844762802124},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6147588491439819},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5910784006118774},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5795395970344543},{"id":"https://openalex.org/keywords/frame","display_name":"Frame (networking)","score":0.47201818227767944},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.4653777480125427},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.35144495964050293},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1661669909954071},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.13758480548858643},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.12417128682136536}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.754889726638794},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6427844762802124},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6147588491439819},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5910784006118774},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5795395970344543},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.47201818227767944},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.4653777480125427},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.35144495964050293},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1661669909954071},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.13758480548858643},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.12417128682136536},{"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/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3390/a9040063","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a9040063","pdf_url":"https://www.mdpi.com/1999-4893/9/4/63/pdf?version=1474717579","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:1f79e14c675b46ba90faae4bf11465b7","is_oa":true,"landing_page_url":"https://doaj.org/article/1f79e14c675b46ba90faae4bf11465b7","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 9, Iss 4, p 63 (2016)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/9/4/63/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a9040063","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"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":"Algorithms; Volume 9; Issue 4; Pages: 63","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a9040063","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a9040063","pdf_url":"https://www.mdpi.com/1999-4893/9/4/63/pdf?version=1474717579","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.4000000059604645,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2523761909.pdf","grobid_xml":"https://content.openalex.org/works/W2523761909.grobid-xml"},"referenced_works_count":62,"referenced_works":["https://openalex.org/W85289681","https://openalex.org/W163276831","https://openalex.org/W190047209","https://openalex.org/W292455349","https://openalex.org/W656435375","https://openalex.org/W1487025936","https://openalex.org/W1580228502","https://openalex.org/W1583958891","https://openalex.org/W1734532720","https://openalex.org/W1966157871","https://openalex.org/W1969053952","https://openalex.org/W1969585181","https://openalex.org/W1985909617","https://openalex.org/W1987465876","https://openalex.org/W1987565711","https://openalex.org/W1997094138","https://openalex.org/W2010800420","https://openalex.org/W2012313434","https://openalex.org/W2015996757","https://openalex.org/W2016007273","https://openalex.org/W2022770422","https://openalex.org/W2024009720","https://openalex.org/W2024742034","https://openalex.org/W2029066203","https://openalex.org/W2029273759","https://openalex.org/W2032495338","https://openalex.org/W2032862602","https://openalex.org/W2034617747","https://openalex.org/W2035328372","https://openalex.org/W2035515281","https://openalex.org/W2037993354","https://openalex.org/W2039653861","https://openalex.org/W2051945369","https://openalex.org/W2052128589","https://openalex.org/W2052334377","https://openalex.org/W2057018686","https://openalex.org/W2062607013","https://openalex.org/W2067801697","https://openalex.org/W2071608237","https://openalex.org/W2071907541","https://openalex.org/W2081990930","https://openalex.org/W2088032283","https://openalex.org/W2091648513","https://openalex.org/W2111185171","https://openalex.org/W2112142199","https://openalex.org/W2117837254","https://openalex.org/W2118365460","https://openalex.org/W2120810386","https://openalex.org/W2144470745","https://openalex.org/W2149521180","https://openalex.org/W2151364317","https://openalex.org/W2168927094","https://openalex.org/W2247955054","https://openalex.org/W2287814884","https://openalex.org/W2414365832","https://openalex.org/W2487540326","https://openalex.org/W2503236784","https://openalex.org/W3103824307","https://openalex.org/W3121758120","https://openalex.org/W4285719527","https://openalex.org/W6660701033","https://openalex.org/W6668205994"],"related_works":["https://openalex.org/W3172150420","https://openalex.org/W2107725657","https://openalex.org/W2112121444","https://openalex.org/W2509452605","https://openalex.org/W3112689649","https://openalex.org/W2148608945","https://openalex.org/W2101020326","https://openalex.org/W2808535280","https://openalex.org/W3122821775","https://openalex.org/W3204654320"],"abstract_inverted_index":{"Modeling":[0],"and":[1,22,39,55,111,118,131,167,181],"optimizing":[2],"organizational":[3],"processes,":[4],"such":[5],"as":[6],"the":[7,11,27,48,53,80,126,132,135,189,197],"one":[8],"represented":[9],"by":[10],"Resource-Constrained":[12],"Project":[13],"Scheduling":[14],"Problem":[15],"(RCPSP),":[16],"improve":[17],"outcomes.":[18],"Based":[19],"on":[20,86,141],"assumptions":[21],"simplification,":[23],"this":[24,104],"model":[25,127],"tackles":[26],"allocation":[28],"of":[29,47,79,125,134,151],"resources":[30],"so":[31],"that":[32,64,144,158],"organizations":[33],"can":[34,65],"continue":[35],"to":[36,51,162,168,196],"generate":[37],"profits":[38],"reinvest":[40],"in":[41,70,100,186],"future":[42],"growth.":[43],"Nonetheless,":[44],"despite":[45],"all":[46],"research":[49],"dedicated":[50],"solving":[52],"RCPSP":[54,115],"its":[56,152],"multi-mode":[57],"variations,":[58],"there":[59],"is":[60,75,129,138,145,160],"no":[61],"standardized":[62],"procedure":[63],"guide":[66],"project":[67,149],"management":[68],"practitioners":[69],"their":[71,179],"scheduling":[72],"tasks.":[73],"This":[74],"mainly":[76],"because":[77],"many":[78,187],"proposed":[81,136],"approaches":[82],"are":[83],"either":[84],"based":[85],"unrealistic/oversimplified":[87],"scenarios":[88],"or":[89,97],"they":[90],"propose":[91],"solution":[92],"procedures":[93],"not":[94],"easily":[95],"applicable":[96],"even":[98],"feasible":[99],"real-life":[101],"situations.":[102],"In":[103,184],"study,":[105],"we":[106],"solve":[107],"a":[108,164],"more":[109],"true-to-life":[110],"complex":[112],"model,":[113],"Multimode":[114],"with":[116,173],"minimal":[117],"maximal":[119],"time":[120],"lags":[121],"(MRCPSP/max).":[122],"The":[123,155],"complexity":[124],"solved":[128,190],"presented,":[130],"practicality":[133],"approach":[137],"justified":[139],"depending":[140],"only":[142],"information":[143],"available":[146],"for":[147],"every":[148],"regardless":[150],"industrial":[153],"context.":[154],"results":[156],"confirm":[157],"it":[159],"possible":[161],"determine":[163],"robust":[165],"makespan":[166],"calculate":[169],"an":[170],"execution":[171],"time-frame":[172],"gaps":[174],"lower":[175,180,191],"than":[176],"11%":[177],"between":[178],"upper":[182],"bounds.":[183],"addition,":[185],"instances,":[188],"bound":[192],"obtained":[193],"was":[194],"equal":[195],"best-known":[198],"optimum.":[199]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}