{"id":"https://openalex.org/W1491489507","doi":"https://doi.org/10.1109/cmpsac.2004.1342820","title":"Dynamic real-time scheduling for multi-processor tasks using genetic algorithm","display_name":"Dynamic real-time scheduling for multi-processor tasks using genetic algorithm","publication_year":2004,"publication_date":"2004-11-08","ids":{"openalex":"https://openalex.org/W1491489507","doi":"https://doi.org/10.1109/cmpsac.2004.1342820","mag":"1491489507"},"language":"en","primary_location":{"id":"doi:10.1109/cmpsac.2004.1342820","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cmpsac.2004.1342820","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 28th Annual International Computer Software and Applications Conference, 2004. COMPSAC 2004.","raw_type":"proceedings-article"},"type":"conference-paper","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/A5086314866","display_name":"Shu-Chen Cheng","orcid":"https://orcid.org/0000-0002-5233-9386"},"institutions":[{"id":"https://openalex.org/I16733864","display_name":"National Taiwan University","ror":"https://ror.org/05bqach95","country_code":"TW","type":"education","lineage":["https://openalex.org/I16733864"]},{"id":"https://openalex.org/I92582371","display_name":"Southern Taiwan University of Science and Technology","ror":"https://ror.org/0029n1t76","country_code":"TW","type":"education","lineage":["https://openalex.org/I92582371"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Shu-Chen Cheng","raw_affiliation_strings":["Department of Computer Science and Information Engineering, Southern Taiwan University of Technology, Taiwan","Department of Computer Science and Information Engineering, Southern Taiwan University of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Engineering, Southern Taiwan University of Technology, Taiwan","institution_ids":["https://openalex.org/I92582371"]},{"raw_affiliation_string":"Department of Computer Science and Information Engineering, Southern Taiwan University of Technology","institution_ids":["https://openalex.org/I16733864"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071574103","display_name":"Yueh\u2010Min Huang","orcid":"https://orcid.org/0000-0001-7052-1272"},"institutions":[{"id":"https://openalex.org/I91807558","display_name":"National Cheng Kung University","ror":"https://ror.org/01b8kcc49","country_code":"TW","type":"education","lineage":["https://openalex.org/I91807558"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Yueh-Min Huang","raw_affiliation_strings":["Department of Engineering Science, National Engineering Kung University, Tainan, Taiwan","National Cheng-Kung University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Engineering Science, National Engineering Kung University, Tainan, Taiwan","institution_ids":["https://openalex.org/I91807558"]},{"raw_affiliation_string":"National Cheng-Kung University","institution_ids":["https://openalex.org/I91807558"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"154","last_page":"160"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9986000061035156,"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"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9986000061035156,"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"}},{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9983000159263611,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9889000058174133,"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/crossover","display_name":"Crossover","score":0.7104395627975464},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6980665922164917},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5904964804649353},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5797164440155029},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.5664092302322388},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5417874455451965},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.5037543177604675},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.4838887155056},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.46691468358039856},{"id":"https://openalex.org/keywords/least-slack-time-scheduling","display_name":"Least slack time scheduling","score":0.42559659481048584},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.42443087697029114},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.42302316427230835},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1385761797428131},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10934588313102722}],"concepts":[{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.7104395627975464},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6980665922164917},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5904964804649353},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5797164440155029},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5664092302322388},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5417874455451965},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.5037543177604675},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.4838887155056},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.46691468358039856},{"id":"https://openalex.org/C132439773","wikidata":"https://www.wikidata.org/wiki/Q1810747","display_name":"Least slack time scheduling","level":5,"score":0.42559659481048584},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.42443087697029114},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.42302316427230835},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1385761797428131},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10934588313102722},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cmpsac.2004.1342820","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cmpsac.2004.1342820","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 28th Annual International Computer Software and Applications Conference, 2004. COMPSAC 2004.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.4399999976158142}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1529601040","https://openalex.org/W1815457062","https://openalex.org/W2079273758","https://openalex.org/W2099956623","https://openalex.org/W2124232062","https://openalex.org/W2124333496","https://openalex.org/W2125367223","https://openalex.org/W2142183404","https://openalex.org/W2149823829"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W2949165180","https://openalex.org/W2155809154","https://openalex.org/W2838819579","https://openalex.org/W131757205","https://openalex.org/W2225350526","https://openalex.org/W2533899164","https://openalex.org/W2807934311","https://openalex.org/W2245286458","https://openalex.org/W2167574351"],"abstract_inverted_index":{"With":[0],"the":[1,11,25,42,46,62,65,71,74,78,88,100,145],"exponential":[2],"growth":[3],"of":[4],"time":[5,22],"to":[6,44,56,61,82,86,98,114,138,151],"obtain":[7],"an":[8,135],"optimal":[9,31],"solution,":[10],"job-shop":[12,47],"scheduling":[13,48,101,125],"problems":[14,126],"have":[15,40],"been":[16],"categorized":[17],"as":[18],"NP-complete":[19],"problems.":[20,49,102],"The":[21],"complexity":[23],"makes":[24],"exhaustive":[26],"search":[27],"for":[28],"a":[29,51,106,110],"global":[30],"schedule":[32],"infeasible":[33],"or":[34,77,91],"even":[35],"impossible.":[36],"Recently,":[37],"genetic":[38,79],"algorithms":[39],"shown":[41],"feasibility":[43],"solve":[45,99],"However,":[50],"pure":[52],"GA-based":[53,107],"approach":[54,108,147],"tends":[55],"generate":[57,115,139],"illegal":[58],"schedules":[59,141],"due":[60],"crossover":[63],"and":[64,142],"mutation":[66],"operators.":[67],"It":[68],"is":[69],"often":[70],"case":[72],"that":[73,144],"gene":[75],"expression":[76],"operators":[80],"need":[81],"be":[83,96],"specially":[84],"tailored":[85],"fit":[87],"problem":[89],"domain":[90],"some":[92],"other":[93],"schemes":[94],"may":[95],"combined":[97],"This":[103,118],"work":[104,119],"presents":[105],"with":[109,127],"feasible":[111],"energy":[112],"function":[113],"good-quality":[116],"schedules.":[117],"concentrates":[120],"mainly":[121],"on":[122],"dynamic":[123],"real-time":[124],"constraint":[128],"satisfaction.":[129],"In":[130],"our":[131],"work,":[132],"we":[133],"design":[134],"easy-understood":[136],"genotype":[137],"legal":[140],"induce":[143],"proposed":[146],"can":[148],"converge":[149],"rapidly":[150],"address":[152],"its":[153],"applicability.":[154]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}