{"id":"https://openalex.org/W2291391981","doi":null,"title":"Two heuristic algorithms for a multi-mode resource-constrained multi-project scheduling problem","display_name":"Two heuristic algorithms for a multi-mode resource-constrained multi-project scheduling problem","alternate_titles":[],"publication_year":2008,"publication_date":"2008-06-01","ids":{"openalex":"https://openalex.org/W2291391981","mag":"2291391981"},"language":"en","primary_location":{"id":"mag:2291391981","doi":null,"is_oa":false,"landing_page_url":"http://aries.dyu.edu.tw/~cctseng/Paper/Two%20Heuristic%20Algorithms%20for%20a%20Multi-Mode%20Resource-Constrained%20Multi-Project%20Scheduling%20Problem.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W2291391981"],"child_works_count":0,"type":"article","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/A5062195904","display_name":"Ching Chih Tseng","orcid":"https://orcid.org/0000-0003-2781-9270","observed_orcids":["https://orcid.org/0000-0003-2781-9270"]},"institutions":[],"countries":[],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"Ching Chih Tseng","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-2781-9270","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5062195904"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.5157,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.81984449,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":86,"max":96},"biblio":{"volume":"63","issue":"74","first_page":null,"last_page":null},"is_retracted":false,"is_pulled":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":9.999999747378752e-05,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.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"}}],"keywords":[{"id":"https://openalex.org/keywords/multi-mode-resource-constrained-project-scheduling","display_name":"multi-mode resource-constrained project scheduling","score":0.9509999752044678},{"id":"https://openalex.org/keywords/multi-project-scheduling","display_name":"multi-project scheduling","score":0.9879999756813049},{"id":"https://openalex.org/keywords/heuristic-scheduling-algorithm","display_name":"heuristic scheduling algorithm","score":0.7319999933242798},{"id":"https://openalex.org/keywords/parallel-scheduling-algorithm","display_name":"parallel scheduling algorithm","score":0.9200000166893005},{"id":"https://openalex.org/keywords/dispatching-rules","display_name":"dispatching rules","score":0.7730000019073486},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"genetic algorithm","score":0.8460000157356262},{"id":"https://openalex.org/keywords/deadlines","display_name":"deadlines","score":0.7680000066757202},{"id":"https://openalex.org/keywords/resource-availability","display_name":"resource availability","score":0.7799999713897705},{"id":"https://openalex.org/keywords/two-stage-sampling","display_name":"two-stage sampling","score":0.8690000176429749}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6791148781776428},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5389002561569214},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5162003636360168},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4980800151824951},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48852217197418213},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4655868113040924},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16369763016700745},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13078099489212036}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2291391981","doi":null,"is_oa":false,"landing_page_url":"http://aries.dyu.edu.tw/~cctseng/Paper/Two%20Heuristic%20Algorithms%20for%20a%20Multi-Mode%20Resource-Constrained%20Multi-Project%20Scheduling%20Problem.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"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":27,"referenced_works":["https://openalex.org/W56946092","https://openalex.org/W1497256448","https://openalex.org/W1533019039","https://openalex.org/W1583958891","https://openalex.org/W1967520000","https://openalex.org/W1971274730","https://openalex.org/W1988981030","https://openalex.org/W1997094138","https://openalex.org/W2003759470","https://openalex.org/W2024742034","https://openalex.org/W2036112575","https://openalex.org/W2042486704","https://openalex.org/W2048541053","https://openalex.org/W2055522783","https://openalex.org/W2067801697","https://openalex.org/W2068616350","https://openalex.org/W2070975460","https://openalex.org/W2085990305","https://openalex.org/W2089376913","https://openalex.org/W2093819688","https://openalex.org/W2095332973","https://openalex.org/W2149521180","https://openalex.org/W2152150600","https://openalex.org/W2152999180","https://openalex.org/W2158814833","https://openalex.org/W2904250082","https://openalex.org/W3023540311"],"related_works":["https://openalex.org/W2295971605","https://openalex.org/W3208972944","https://openalex.org/W3125454972","https://openalex.org/W2042486704","https://openalex.org/W7096050207","https://openalex.org/W2368770509","https://openalex.org/W428221843","https://openalex.org/W2375863510","https://openalex.org/W2373542286","https://openalex.org/W2976285507"],"abstract_inverted_index":{"Many":[0],"studies":[1],"on":[2,177],"the":[3,21,61,72,76,93,109,114,120,159,163,167,178,185,193],"resource-constrained":[4,39],"project-scheduling":[5],"problem":[6,42],"have":[7],"been":[8],"published,":[9],"but":[10],"literature":[11],"further":[12],"considering":[13],"multi-mode":[14,38],"or":[15],"multi-project":[16,40],"issues":[17],"often":[18],"occurring":[19],"in":[20,119],"real":[22],"world":[23],"is":[24,63,147],"rather":[25],"scarce.":[26],"In":[27,123],"this":[28],"research,":[29],"two":[30,126,130],"heuristic":[31],"algorithms":[32],"are":[33,83,105,133,156,175,190],"developed":[34],"to":[35,88,107,136,149],"solve":[36],"a":[37,46,52,58,64,86,143],"scheduling":[41,48],"(MMRCMPSP).":[43],"The":[44,68],"first,":[45],"parallel":[47],"algorithm":[49,66,74],"(PSA),":[50],"includes":[51],"combination":[53,82,174],"of":[54,98,103],"an":[55],"activity-":[56,78,169],"and":[57,79,129,170],"mode-priority":[59,80],"rule;":[60],"second":[62],"genetic":[65],"(GA).":[67],"solutions":[69,160],"obtained":[70,91,161,183],"by":[71,92,162,184],"former":[73],"with":[75,181],"best":[77,110,117,168],"rule":[81,173],"used":[84],"as":[85],"baseline":[87],"compare":[89],"those":[90,182],"latter.":[94],"On":[95],"four":[96],"sets":[97],"test":[99,179],"problems,":[100],"twenty":[101],"combinations":[102],"rules":[104],"compared":[106,176],"determine":[108],"one":[111],"for":[112],"deriving":[113],"most":[115],"likely":[116],"solution":[118],"proposed":[121,164,186],"PSA.":[122],"each":[124],"set,":[125],"resource-availability":[127],"levels":[128,132],"due-date":[131],"considered.":[134],"Due":[135],"certain":[137],"priority":[138,172],"rules\u2019":[139],"having":[140,166],"probabilistic":[141],"factors,":[142],"two-stage":[144],"sampling":[145],"method":[146],"introduced":[148],"ensure":[150],"that":[151],"more":[152],"reliable":[153],"computational":[154,194],"results":[155],"obtained.":[157],"Finally,":[158,188],"PSA":[165],"mode-":[171],"problems":[180],"GA.":[187],"conclusions":[189],"drawn":[191],"from":[192],"results.":[195]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2291391981","counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
