{"id":"https://openalex.org/W7128677363","doi":"https://doi.org/10.7717/peerj-cs.3613","title":"Design and optimization of human resource scheduling strategies using intelligent evolutionary algorithms","display_name":"Design and optimization of human resource scheduling strategies using intelligent evolutionary algorithms","publication_year":2026,"publication_date":"2026-02-12","ids":{"openalex":"https://openalex.org/W7128677363","doi":"https://doi.org/10.7717/peerj-cs.3613"},"language":"en","primary_location":{"id":"doi:10.7717/peerj-cs.3613","is_oa":true,"landing_page_url":"https://doi.org/10.7717/peerj-cs.3613","pdf_url":null,"source":{"id":"https://openalex.org/S4210178049","display_name":"PeerJ Computer Science","issn_l":"2376-5992","issn":["2376-5992"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320104","host_organization_name":"PeerJ, Inc.","host_organization_lineage":["https://openalex.org/P4310320104"],"host_organization_lineage_names":["PeerJ, Inc."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"PeerJ Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.7717/peerj-cs.3613","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5125686667","display_name":"Zhenan Zhang","orcid":null},"institutions":[{"id":"https://openalex.org/I169019527","display_name":"Quanzhou Normal University","ror":"https://ror.org/006ak0b38","country_code":"CN","type":"education","lineage":["https://openalex.org/I169019527"]},{"id":"https://openalex.org/I4210120701","display_name":"The 180th Hospital of PLA","ror":"https://ror.org/01ye08k77","country_code":"CN","type":"healthcare","lineage":["https://openalex.org/I4210120701"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Zhenan Zhang","raw_affiliation_strings":["Department of Human Resource, Quanzhou First Hospital, Quanzhou, Fujian, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Human Resource, Quanzhou First Hospital, Quanzhou, Fujian, China","institution_ids":["https://openalex.org/I4210120701","https://openalex.org/I169019527"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038265911","display_name":"Muhammad Sheraz Arshad Malik","orcid":"https://orcid.org/0000-0002-0944-6362"},"institutions":[{"id":"https://openalex.org/I194348271","display_name":"Government College University, Faisalabad","ror":"https://ror.org/051zgra59","country_code":"PK","type":"education","lineage":["https://openalex.org/I194348271"]}],"countries":["PK"],"is_corresponding":false,"raw_author_name":"Muhammad Sheraz Arshad Malik","raw_affiliation_strings":["Department of Software Engineering, Government College University, Faisalabad, Pakistan"],"raw_orcid":"https://orcid.org/0000-0002-0944-6362","affiliations":[{"raw_affiliation_string":"Department of Software Engineering, Government College University, Faisalabad, Pakistan","institution_ids":["https://openalex.org/I194348271"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5125686667"],"corresponding_institution_ids":["https://openalex.org/I169019527","https://openalex.org/I4210120701"],"apc_list":{"value":1395,"currency":"USD","value_usd":1395},"apc_paid":{"value":1395,"currency":"USD","value_usd":1395},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.24071025,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"12","issue":null,"first_page":"e3613","last_page":"e3613"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.21879999339580536,"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.21879999339580536,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.12030000239610672,"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/T13812","display_name":"AI and HR Technologies","score":0.11729999631643295,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/differential-evolution","display_name":"Differential evolution","score":0.6797999739646912},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5814999938011169},{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.5735999941825867},{"id":"https://openalex.org/keywords/premature-convergence","display_name":"Premature convergence","score":0.564300000667572},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5303000211715698},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.5130000114440918},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.48559999465942383},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.43220001459121704}],"concepts":[{"id":"https://openalex.org/C74750220","wikidata":"https://www.wikidata.org/wiki/Q2662197","display_name":"Differential evolution","level":2,"score":0.6797999739646912},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6703000068664551},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.626800000667572},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5814999938011169},{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.5735999941825867},{"id":"https://openalex.org/C58758708","wikidata":"https://www.wikidata.org/wiki/Q7240233","display_name":"Premature convergence","level":3,"score":0.564300000667572},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5303000211715698},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.5130000114440918},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.48559999465942383},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.43220001459121704},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.39100000262260437},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.382099986076355},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.3749000132083893},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3644999861717224},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.35920000076293945},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.3321000039577484},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.32030001282691956},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.305400013923645},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.28790000081062317},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.25839999318122864},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.2533999979496002}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.7717/peerj-cs.3613","is_oa":true,"landing_page_url":"https://doi.org/10.7717/peerj-cs.3613","pdf_url":null,"source":{"id":"https://openalex.org/S4210178049","display_name":"PeerJ Computer Science","issn_l":"2376-5992","issn":["2376-5992"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320104","host_organization_name":"PeerJ, Inc.","host_organization_lineage":["https://openalex.org/P4310320104"],"host_organization_lineage_names":["PeerJ, Inc."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"PeerJ Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:63b0b6432b13407c86161af2a5edc870","is_oa":true,"landing_page_url":"https://doaj.org/article/63b0b6432b13407c86161af2a5edc870","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","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":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"PeerJ Computer Science, Vol 12, p e3613 (2026)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.7717/peerj-cs.3613","is_oa":true,"landing_page_url":"https://doi.org/10.7717/peerj-cs.3613","pdf_url":null,"source":{"id":"https://openalex.org/S4210178049","display_name":"PeerJ Computer Science","issn_l":"2376-5992","issn":["2376-5992"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320104","host_organization_name":"PeerJ, Inc.","host_organization_lineage":["https://openalex.org/P4310320104"],"host_organization_lineage_names":["PeerJ, Inc."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"PeerJ Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.43106183409690857}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W872034875","https://openalex.org/W2799389980","https://openalex.org/W2955817285","https://openalex.org/W3210330562","https://openalex.org/W4283363737","https://openalex.org/W4283712211","https://openalex.org/W4295210927","https://openalex.org/W4307829938","https://openalex.org/W4360770806","https://openalex.org/W4366446456","https://openalex.org/W4375867750","https://openalex.org/W4386282622","https://openalex.org/W4386541365","https://openalex.org/W4387308270","https://openalex.org/W4390142050","https://openalex.org/W4390942032","https://openalex.org/W4391176904","https://openalex.org/W4392154394","https://openalex.org/W4392380468","https://openalex.org/W4394673300","https://openalex.org/W4396595914","https://openalex.org/W4401702794","https://openalex.org/W4403489600"],"related_works":[],"abstract_inverted_index":{"To":[0],"address":[1],"the":[2,63,72,99,110,132],"limitations":[3],"of":[4,74],"traditional":[5,122],"algorithms":[6,124],"in":[7,81,141,163],"human":[8,46],"resource":[9,47,148],"scheduling":[10,48,168],"optimization":[11,38,43],"under":[12],"multiple":[13],"constraints\u2014such":[14],"as":[15],"slow":[16],"convergence":[17,80,165],"and":[18,35,66,78,92,130,167],"low":[19],"constraint":[20,156],"satisfaction":[21,157],"rates\u2014this":[22],"study":[23],"proposes":[24],"a":[25,41,93,137],"hybrid":[26],"intelligent":[27],"algorithm":[28,57,135],"(ADE-ACO)":[29],"integrating":[30],"adaptive":[31,54,88],"differential":[32,55,127],"evolution":[33,56,128],"(ADE)":[34],"ant":[36],"colony":[37],"(ACO).":[39],"First,":[40],"multi-objective":[42],"model":[44],"for":[45],"is":[49,58,104],"constructed.":[50],"Then,":[51],"an":[52,87],"improved":[53],"designed,":[59],"which":[60],"dynamically":[61],"adjusts":[62],"scaling":[64],"factor":[65],"crossover":[67],"probability":[68],"to":[69,121,150],"effectively":[70],"mitigate":[71],"issues":[73],"local":[75],"optima":[76],"stagnation":[77],"premature":[79],"conventional":[82],"methods.":[83],"Furthermore,":[84],"by":[85],"incorporating":[86],"pheromone":[89],"update":[90],"mechanism":[91],"multi-attribute":[94],"dynamic":[95],"candidate":[96],"list":[97],"strategy,":[98],"algorithm\u2019s":[100],"global":[101],"search":[102],"capability":[103],"significantly":[105],"enhanced.":[106],"Experimental":[107],"validation":[108],"on":[109],"Project":[111],"Scheduling":[112],"Problem":[113],"Library":[114],"(PSPLIB)":[115],"benchmark":[116],"dataset":[117],"demonstrates":[118],"that":[119],"compared":[120],"baseline":[123],"including":[125],"standard":[126],"(SDE)":[129],"ACO,":[131],"proposed":[133],"ADE-ACO":[134],"achieves":[136],"32%":[138],"significant":[139],"reduction":[140],"makespan":[142],"(":[143],"p":[144],"<":[145],"0.01),":[146],"improves":[147],"utilization":[149],"92.3%,":[151],"while":[152],"maintaining":[153],"over":[154],"95%":[155],"rate,":[158],"conclusively":[159],"proving":[160],"its":[161],"superiority":[162],"both":[164],"performance":[166],"quality.":[169]},"counts_by_year":[],"updated_date":"2026-05-06T08:25:59.206177","created_date":"2026-02-13T00:00:00"}