{"id":"https://openalex.org/W2118958797","doi":"https://doi.org/10.1109/icnc.2011.6022236","title":"An activity-based genetic algorithm approach to multiprocessor scheduling","display_name":"An activity-based genetic algorithm approach to multiprocessor scheduling","publication_year":2011,"publication_date":"2011-07-01","ids":{"openalex":"https://openalex.org/W2118958797","doi":"https://doi.org/10.1109/icnc.2011.6022236","mag":"2118958797"},"language":"en","primary_location":{"id":"doi:10.1109/icnc.2011.6022236","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnc.2011.6022236","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 Seventh International Conference on Natural Computation","raw_type":"proceedings-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/A5062832787","display_name":"Yan Kang","orcid":"https://orcid.org/0000-0001-6969-0562"},"institutions":[{"id":"https://openalex.org/I189210763","display_name":"Yunnan University","ror":"https://ror.org/0040axw97","country_code":"CN","type":"education","lineage":["https://openalex.org/I189210763"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Yan Kang","raw_affiliation_strings":["department of software engineering school of software, yunnan university, Kunming, Yunnan, China","Department of Software Engineering, School of Software, Yunnan University, Kunming, China"],"affiliations":[{"raw_affiliation_string":"department of software engineering school of software, yunnan university, Kunming, Yunnan, China","institution_ids":["https://openalex.org/I189210763"]},{"raw_affiliation_string":"Department of Software Engineering, School of Software, Yunnan University, Kunming, China","institution_ids":["https://openalex.org/I189210763"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101804313","display_name":"Zhenchao Zhang","orcid":"https://orcid.org/0000-0003-2816-3605"},"institutions":[{"id":"https://openalex.org/I189210763","display_name":"Yunnan University","ror":"https://ror.org/0040axw97","country_code":"CN","type":"education","lineage":["https://openalex.org/I189210763"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhenchao Zhang","raw_affiliation_strings":["school of software, yunnan university, Kunming, Yunnan, China","[School of Software Yunnan University Kunming, China]"],"affiliations":[{"raw_affiliation_string":"school of software, yunnan university, Kunming, Yunnan, China","institution_ids":["https://openalex.org/I189210763"]},{"raw_affiliation_string":"[School of Software Yunnan University Kunming, China]","institution_ids":["https://openalex.org/I189210763"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045998424","display_name":"Pengwu Chen","orcid":null},"institutions":[{"id":"https://openalex.org/I189210763","display_name":"Yunnan University","ror":"https://ror.org/0040axw97","country_code":"CN","type":"education","lineage":["https://openalex.org/I189210763"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Pengwu Chen","raw_affiliation_strings":["school of software, yunnan university, Kunming, Yunnan, China","[School of Software Yunnan University Kunming, China]"],"affiliations":[{"raw_affiliation_string":"school of software, yunnan university, Kunming, Yunnan, China","institution_ids":["https://openalex.org/I189210763"]},{"raw_affiliation_string":"[School of Software Yunnan University Kunming, China]","institution_ids":["https://openalex.org/I189210763"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5062832787"],"corresponding_institution_ids":["https://openalex.org/I189210763"],"apc_list":null,"apc_paid":null,"fwci":0.3501,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.6443557,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1048","last_page":"1052"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9998999834060669,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9921000003814697,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7876467704772949},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.7328096032142639},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.5728231072425842},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.569951057434082},{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.5258258581161499},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.5076805353164673},{"id":"https://openalex.org/keywords/fixed-priority-pre-emptive-scheduling","display_name":"Fixed-priority pre-emptive scheduling","score":0.49167829751968384},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.488044410943985},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.4660763740539551},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.4451792538166046},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.44148701429367065},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3876428008079529},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.36512327194213867},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2414579689502716},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1569192111492157},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.14707669615745544},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.07894957065582275}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7876467704772949},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.7328096032142639},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5728231072425842},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.569951057434082},{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.5258258581161499},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.5076805353164673},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.49167829751968384},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.488044410943985},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.4660763740539551},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.4451792538166046},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.44148701429367065},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3876428008079529},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.36512327194213867},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2414579689502716},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1569192111492157},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.14707669615745544},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07894957065582275},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icnc.2011.6022236","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnc.2011.6022236","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 Seventh International Conference on Natural Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1488422606","https://openalex.org/W1535233371","https://openalex.org/W1562653311","https://openalex.org/W2004988342","https://openalex.org/W2010868970","https://openalex.org/W2019356799","https://openalex.org/W2112998751","https://openalex.org/W2114719509","https://openalex.org/W2118396891","https://openalex.org/W2129606970","https://openalex.org/W2149294210","https://openalex.org/W2151038512","https://openalex.org/W6679729614"],"related_works":["https://openalex.org/W4300092030","https://openalex.org/W2167574351","https://openalex.org/W1545991362","https://openalex.org/W2184166483","https://openalex.org/W3184267879","https://openalex.org/W2545511463","https://openalex.org/W2404383452","https://openalex.org/W2245286458","https://openalex.org/W177179517","https://openalex.org/W2076947091"],"abstract_inverted_index":{"In":[0],"parallel":[1],"and":[2,61,91,120,144,158,165],"distributed":[3],"computing,":[4],"development":[5],"of":[6,36,65,88,108,112,148,170],"an":[7,20,75,133],"efficient":[8],"static":[9,24],"task":[10,25,41,78,137],"scheduling":[11,26,42,79,101,181],"algorithm":[12,80,102,131,172],"for":[13,81],"directed":[14],"acyclic":[15],"graph":[16],"(DAG)":[17],"applications":[18],"is":[19,28,43,103,139,173],"important":[21],"problem.":[22],"The":[23,34,168],"problem":[27,38],"NP-complete":[29],"in":[30,47,54,105,162],"its":[31],"general":[32],"form.":[33],"complexity":[35],"the":[37,52,55,69,82,86,106,109,130,142,146,149,156,159,163,171,178],"increase":[39],"when":[40,124],"to":[44,67,115,126,135],"be":[45,59,152],"done":[46],"a":[48,99,113],"heterogeneous":[49,89],"environment,":[50],"where":[51],"processors":[53],"network":[56,87],"may":[57],"not":[58],"identical":[60],"take":[62],"different":[63],"amounts":[64],"time":[66],"execute":[68],"same":[70],"task.":[71],"This":[72],"paper":[73],"presents":[74],"activity-based":[76],"genetic":[77],"tasks":[83],"run":[84],"on":[85,141],"systems":[90],"represented":[92],"by":[93,154,175],"Directed":[94],"Acyclic":[95],"Graphs":[96],"(DAGs).":[97],"First,":[98],"list":[100],"incorporated":[104],"generation":[107],"initial":[110],"population":[111],"GA":[114],"represent":[116],"feasible":[117],"operation":[118],"sequences":[119],"diminish":[121],"coding":[122],"space":[123],"compared":[125],"permutation":[127],"representation.":[128],"Second,":[129],"assigns":[132],"activity":[134,157],"each":[136],"which":[138],"assigned":[140],"processor,":[143],"then":[145],"quality":[147],"solution":[150],"will":[151],"improved":[153],"adding":[155],"random":[160],"probability":[161],"crossover":[164],"mutation":[166],"operator.":[167],"performance":[169],"illustrated":[174],"comparing":[176],"with":[177],"existing":[179],"effectively":[180],"algorithms.":[182]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":5},{"year":2018,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}