{"id":"https://openalex.org/W2977959025","doi":null,"title":"Task Scheduling Algorithm in Multiprocessor System Using Genetic Algorithm","display_name":"Task Scheduling Algorithm in Multiprocessor System Using Genetic Algorithm","alternate_titles":[],"publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W2977959025","mag":"2977959025"},"language":"en","primary_location":{"id":"mag:2977959025","doi":null,"is_oa":false,"landing_page_url":"http://www.koreascience.or.kr/article/ArticleFullRecord.jsp?cn=MTMDCW_2006_v9n1_119","pdf_url":null,"source":{"id":"https://openalex.org/S2912711996","display_name":"Journal of Korea Multimedia Society","issn_l":"1229-7771","issn":["1229-7771","2384-0102"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["kci-registered"],"host_organization":"https://openalex.org/P4324046841","host_organization_name":"Korea Multimedia Society","host_organization_lineage":["https://openalex.org/P4324046841"],"host_organization_lineage_names":["Korea Multimedia Society"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Journal of Korea Multimedia Society","raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W2977959025"],"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/A5100601077","display_name":"Hyunchul Kim","orcid":"https://orcid.org/0000-0002-8006-9504","observed_orcids":["https://orcid.org/0000-0002-8006-9504"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Hyunchul Kim","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-8006-9504","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5100601077"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"9","issue":"1","first_page":"119","last_page":"126"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.6913999915122986,"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.6913999915122986,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.17270000278949738,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.05590000003576279,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/task-scheduling","display_name":"task scheduling","score":0.9959999918937683},{"id":"https://openalex.org/keywords/multiprocessor-systems","display_name":"multiprocessor systems","score":0.9980000257492065},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"genetic algorithm","score":0.9940000176429749},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"simulated annealing","score":0.9990000128746033},{"id":"https://openalex.org/keywords/hybrid-metaheuristic-algorithm","display_name":"hybrid metaheuristic","score":0.8130000233650208},{"id":"https://openalex.org/keywords/makespan-minimization","display_name":"makespan minimization","score":0.9739999771118164},{"id":"https://openalex.org/keywords/task-allocation","display_name":"task allocation","score":0.8429999947547913},{"id":"https://openalex.org/keywords/np-hard-combinatorial-optimization","display_name":"NP-hard combinatorial optimization","score":0.8550000190734863}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7640624046325684},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.7250921726226807},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.6579345464706421},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.6534448862075806},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6316293478012085},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6126077771186829},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5577702522277832},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5513102412223816},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4618569612503052},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.45901432633399963},{"id":"https://openalex.org/C46714192","wikidata":"https://www.wikidata.org/wiki/Q4680763","display_name":"Adaptive simulated annealing","level":3,"score":0.4391198754310608},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.4380035400390625},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4354253113269806},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.4151764512062073},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3258453905582428},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.12750422954559326},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10707959532737732},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.07109659910202026},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.05988869071006775},{"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/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2977959025","doi":null,"is_oa":false,"landing_page_url":"http://www.koreascience.or.kr/article/ArticleFullRecord.jsp?cn=MTMDCW_2006_v9n1_119","pdf_url":null,"source":{"id":"https://openalex.org/S2912711996","display_name":"Journal of Korea Multimedia Society","issn_l":"1229-7771","issn":["1229-7771","2384-0102"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["kci-registered"],"host_organization":"https://openalex.org/P4324046841","host_organization_name":"Korea Multimedia Society","host_organization_lineage":["https://openalex.org/P4324046841"],"host_organization_lineage_names":["Korea Multimedia Society"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Journal of Korea Multimedia Society","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":0,"referenced_works":[],"related_works":["https://openalex.org/W257557536","https://openalex.org/W2100838863","https://openalex.org/W2313865871","https://openalex.org/W1654526531","https://openalex.org/W1986031008","https://openalex.org/W1978559775","https://openalex.org/W2032932574","https://openalex.org/W2184951409","https://openalex.org/W2124903056","https://openalex.org/W16440275"],"abstract_inverted_index":{"The":[0,19,105,115],"task":[1,52],"scheduling":[2,53,109],"in":[3,12,27,63],"multiprocessor":[4,17,25,64],"system":[5],"is":[6,88,111,121,134],"one":[7],"of":[8,16,22,86,94,101,107,117,131,138],"the":[9,13,69,74,84,92,97,118,129],"key":[10],"elements":[11],"effective":[14],"utilization":[15],"systems.":[18],"optimal":[20],"assignment":[21],"tasks":[23],"to":[24,112],"is,":[26],"almost":[28],"practical":[29,45],"cases,":[30],"an":[31],"NP-hard":[32],"problem.":[33],"Consequently":[34],"algorithms":[35],"based":[36],"on":[37],"various":[38],"modern":[39],"heuristics":[40],"have":[41],"been":[42],"proposed":[43,108,119,132],"for":[44,99],"reason.":[46],"This":[47],"paper":[48],"proposes":[49],"a":[50],"new":[51,102],"algorithm":[54,110,120,133],"using":[55],"Genetic":[56,70],"Algorithm":[57,71],"which":[58],"combines":[59],"simulated":[60,75],"annealing":[61,76],"(GA+SA)":[62],"environment.":[65],"In":[66,81,126],"solution":[67],"algorithms,":[68],"(GA)":[72],"and":[73],"(SA)":[77],"are":[78],"cooperatively":[79],"used.":[80],"this":[82],"method,":[83],"convergence":[85],"GA":[87],"improved":[89],"by":[90],"introducing":[91],"probability":[93],"SA":[95],"as":[96],"criterion":[98],"acceptance":[100],"trial":[103],"solution.":[104],"objective":[106],"minimize":[113],"makespan.":[114],"effectiveness":[116],"shown":[122],"through":[123],"simulation":[124,127],"studies.":[125],"studies,":[128],"result":[130],"better":[135],"than":[136],"that":[137],"any":[139],"other":[140],"algorithms.":[141]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2977959025","counts_by_year":[],"updated_date":"2025-10-10T17:16:08.811792","created_date":"2019-10-10T00:00:00"}
