{"id":"https://openalex.org/W4297147395","doi":"https://doi.org/10.1142/s0218126623501001","title":"An On-Board Task Scheduling Method Based on Evolutionary Optimization Algorithm","display_name":"An On-Board Task Scheduling Method Based on Evolutionary Optimization Algorithm","publication_year":2022,"publication_date":"2022-09-25","ids":{"openalex":"https://openalex.org/W4297147395","doi":"https://doi.org/10.1142/s0218126623501001"},"language":"en","primary_location":{"id":"doi:10.1142/s0218126623501001","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218126623501001","pdf_url":null,"source":{"id":"https://openalex.org/S167602672","display_name":"Journal of Circuits Systems and Computers","issn_l":"0218-1266","issn":["0218-1266","1793-6454"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Circuits, Systems and Computers","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/A5098084917","display_name":"Feng Dan","orcid":"https://orcid.org/0000-0001-6397-8645"},"institutions":[{"id":"https://openalex.org/I4210115513","display_name":"Xi\u2019an University","ror":"https://ror.org/01zzmf129","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210115513"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Feng Dan","raw_affiliation_strings":["Beijing Institute of Control Engineering, Zhongguancun Nansan Street, Beijing 100190, Haidian, P.\u00a0R.\u00a0China","Department of Computer Science and Technology, Xi\u2019an University of Electronic Science and Technology, Taibai South Road, Xi\u2019an 710126, Gaoxin, P.\u00a0R.\u00a0China"],"raw_orcid":"https://orcid.org/0000-0001-6397-8645","affiliations":[{"raw_affiliation_string":"Beijing Institute of Control Engineering, Zhongguancun Nansan Street, Beijing 100190, Haidian, P.\u00a0R.\u00a0China","institution_ids":[]},{"raw_affiliation_string":"Department of Computer Science and Technology, Xi\u2019an University of Electronic Science and Technology, Taibai South Road, Xi\u2019an 710126, Gaoxin, P.\u00a0R.\u00a0China","institution_ids":["https://openalex.org/I4210115513"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100461675","display_name":"Bo Liu","orcid":"https://orcid.org/0000-0002-6615-6601"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Liu Bo","raw_affiliation_strings":["Beijing Institute of Control Engineering, Zhongguancun Nansan Street, Beijing 100190, Haidian, P.\u00a0R.\u00a0China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Beijing Institute of Control Engineering, Zhongguancun Nansan Street, Beijing 100190, Haidian, P.\u00a0R.\u00a0China","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110374065","display_name":"Jian Gong","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gong Jian","raw_affiliation_strings":["Beijing Institute of Control Engineering, Zhongguancun Nansan Street, Beijing 100190, Haidian, P.\u00a0R.\u00a0China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Beijing Institute of Control Engineering, Zhongguancun Nansan Street, Beijing 100190, Haidian, P.\u00a0R.\u00a0China","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5098084917"],"corresponding_institution_ids":["https://openalex.org/I4210115513"],"apc_list":null,"apc_paid":null,"fwci":0.6777,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.74649958,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":98},"biblio":{"volume":"32","issue":"06","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9988999962806702,"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"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9988999962806702,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.995199978351593,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10101","display_name":"Cloud Computing and Resource Management","score":0.9871000051498413,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7289637327194214},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.6262355446815491},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.6116148829460144},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5812986493110657},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.5770054459571838},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.5626658201217651},{"id":"https://openalex.org/keywords/fixed-priority-pre-emptive-scheduling","display_name":"Fixed-priority pre-emptive scheduling","score":0.5528697967529297},{"id":"https://openalex.org/keywords/control-reconfiguration","display_name":"Control reconfiguration","score":0.5223684906959534},{"id":"https://openalex.org/keywords/fault-tolerance","display_name":"Fault tolerance","score":0.479581743478775},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4758688807487488},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.47548210620880127},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.4562992751598358},{"id":"https://openalex.org/keywords/backup","display_name":"Backup","score":0.44525110721588135},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.4257052540779114},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2672535181045532},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.23779815435409546},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.20435306429862976},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.07238054275512695}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7289637327194214},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.6262355446815491},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.6116148829460144},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5812986493110657},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.5770054459571838},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.5626658201217651},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.5528697967529297},{"id":"https://openalex.org/C119701452","wikidata":"https://www.wikidata.org/wiki/Q5165881","display_name":"Control reconfiguration","level":2,"score":0.5223684906959534},{"id":"https://openalex.org/C63540848","wikidata":"https://www.wikidata.org/wiki/Q3140932","display_name":"Fault tolerance","level":2,"score":0.479581743478775},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4758688807487488},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.47548210620880127},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.4562992751598358},{"id":"https://openalex.org/C2780945871","wikidata":"https://www.wikidata.org/wiki/Q194274","display_name":"Backup","level":2,"score":0.44525110721588135},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.4257052540779114},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2672535181045532},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.23779815435409546},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.20435306429862976},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.07238054275512695},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0218126623501001","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218126623501001","pdf_url":null,"source":{"id":"https://openalex.org/S167602672","display_name":"Journal of Circuits Systems and Computers","issn_l":"0218-1266","issn":["0218-1266","1793-6454"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Circuits, Systems and Computers","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":8,"referenced_works":["https://openalex.org/W2046437335","https://openalex.org/W2109488193","https://openalex.org/W2118078791","https://openalex.org/W2166900052","https://openalex.org/W2529659779","https://openalex.org/W2913385037","https://openalex.org/W2924172091","https://openalex.org/W4394854636"],"related_works":["https://openalex.org/W4300092030","https://openalex.org/W2184166483","https://openalex.org/W1545991362","https://openalex.org/W3184267879","https://openalex.org/W2167574351","https://openalex.org/W4386128920","https://openalex.org/W2545511463","https://openalex.org/W2404383452","https://openalex.org/W4390711951","https://openalex.org/W2372008037"],"abstract_inverted_index":{"In":[0,36],"order":[1],"to":[2,45,47,62,68,85,141],"meet":[3],"the":[4,26,64,87,95,136,144,153],"requirements":[5],"of":[6,50,97,102,138,146,156],"task":[7,34,39,73],"scheduling":[8,17,40,98,112,155],"in":[9],"on-board":[10,20,27,147,157],"distributed":[11,148],"computing":[12,30,51,128,149],"environment,":[13],"an":[14],"evolutionary":[15],"optimization":[16,92],"method":[18,140],"for":[19,56,111,127],"tasks":[21],"was":[22,43,60,83,125],"proposed":[23],"based":[24,118],"on":[25,119],"dynamic":[28,48],"heterogeneous":[29],"resource":[31],"model":[32],"and":[33,77,93,105,121,151],"model.":[35],"this":[37,139],"method,":[38],"priority":[41],"coding":[42],"used":[44,126],"adapt":[46],"changes":[49],"resources.":[52],"Heuristic":[53],"critical":[54],"path":[55],"comprehensive":[57],"index":[58],"balance":[59,71],"adopted":[61],"implement":[63,152],"evaluation,":[65],"so":[66],"as":[67],"achieve":[69],"a":[70],"between":[72],"makespan,":[74],"power":[75],"consumption":[76],"reliability.":[78],"Multi-group":[79],"neighborhood":[80],"search":[81],"strategy":[82,101,117],"applied":[84],"avoid":[86],"algorithm":[88],"falling":[89],"into":[90],"local":[91],"simplify":[94],"complexity":[96],"algorithm.":[99],"Fault-tolerant":[100],"convergence":[103],"monitoring":[104],"stop":[106],"loss":[107],"reconfiguration":[108],"were":[109],"designed":[110],"unit":[113,129],"fault":[114,130],"tolerance.":[115,131],"Scheduling":[116],"active":[120],"backup":[122],"redundant":[123],"subtasks":[124],"The":[132],"simulation":[133],"results":[134],"showed":[135],"efficiency":[137],"deal":[142],"with":[143],"scenario":[145],"resources":[150],"optimal":[154],"tasks.":[158]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}