{"id":"https://openalex.org/W3190170079","doi":"https://doi.org/10.1109/cec45853.2021.9504867","title":"A Genetic Algorithm for Scheduling Splittable Tasks with Precedence Constraints","display_name":"A Genetic Algorithm for Scheduling Splittable Tasks with Precedence Constraints","publication_year":2021,"publication_date":"2021-06-28","ids":{"openalex":"https://openalex.org/W3190170079","doi":"https://doi.org/10.1109/cec45853.2021.9504867","mag":"3190170079"},"language":"en","primary_location":{"id":"doi:10.1109/cec45853.2021.9504867","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec45853.2021.9504867","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE Congress on Evolutionary Computation (CEC)","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/A5062578811","display_name":"Yuanliang Gao","orcid":null},"institutions":[{"id":"https://openalex.org/I13591777","display_name":"University of Nottingham Ningbo China","ror":"https://ror.org/03y4dt428","country_code":"CN","type":"education","lineage":["https://openalex.org/I13591777","https://openalex.org/I142263535"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yuanliang Gao","raw_affiliation_strings":["University of Nottingham, Ningbo China,School of Computer Science,Ningbo,China","School of Computer Science, University of Nottingham, Ningbo China, Ningbo, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Nottingham, Ningbo China,School of Computer Science,Ningbo,China","institution_ids":["https://openalex.org/I13591777"]},{"raw_affiliation_string":"School of Computer Science, University of Nottingham, Ningbo China, Ningbo, China","institution_ids":["https://openalex.org/I13591777"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033090571","display_name":"Sheung-Hung Poon","orcid":"https://orcid.org/0000-0002-1777-9394"},"institutions":[{"id":"https://openalex.org/I13591777","display_name":"University of Nottingham Ningbo China","ror":"https://ror.org/03y4dt428","country_code":"CN","type":"education","lineage":["https://openalex.org/I13591777","https://openalex.org/I142263535"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Sheung-Hung Poon","raw_affiliation_strings":["University of Nottingham, Ningbo China,School of Computer Science,Ningbo,China","School of Computer Science, University of Nottingham, Ningbo China, Ningbo, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Nottingham, Ningbo China,School of Computer Science,Ningbo,China","institution_ids":["https://openalex.org/I13591777"]},{"raw_affiliation_string":"School of Computer Science, University of Nottingham, Ningbo China, Ningbo, China","institution_ids":["https://openalex.org/I13591777"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I13591777"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"206","issue":null,"first_page":"1808","last_page":"1816"},"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.9994999766349792,"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.9980000257492065,"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.7517983913421631},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.60025954246521},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5738850235939026},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5152509808540344},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5081741809844971},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4925916790962219},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.4621361792087555},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.43162328004837036},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4075245261192322},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37105095386505127},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1441923975944519},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.07543331384658813}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7517983913421631},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.60025954246521},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5738850235939026},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5152509808540344},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5081741809844971},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4925916790962219},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4621361792087555},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.43162328004837036},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4075245261192322},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37105095386505127},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1441923975944519},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.07543331384658813},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"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/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec45853.2021.9504867","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec45853.2021.9504867","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE Congress on Evolutionary Computation (CEC)","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":35,"referenced_works":["https://openalex.org/W616339485","https://openalex.org/W655935858","https://openalex.org/W1515441675","https://openalex.org/W1546023401","https://openalex.org/W1607768087","https://openalex.org/W1964122413","https://openalex.org/W1967030015","https://openalex.org/W1989932424","https://openalex.org/W1993720874","https://openalex.org/W2013064905","https://openalex.org/W2028351695","https://openalex.org/W2034919502","https://openalex.org/W2057913648","https://openalex.org/W2069125079","https://openalex.org/W2086190489","https://openalex.org/W2090166506","https://openalex.org/W2104489014","https://openalex.org/W2119742251","https://openalex.org/W2149294210","https://openalex.org/W2153727208","https://openalex.org/W2162767333","https://openalex.org/W2264583077","https://openalex.org/W2264711506","https://openalex.org/W2487079071","https://openalex.org/W2506839185","https://openalex.org/W2595507424","https://openalex.org/W2724629781","https://openalex.org/W2774185825","https://openalex.org/W2793183753","https://openalex.org/W2899344667","https://openalex.org/W2907874881","https://openalex.org/W2989723739","https://openalex.org/W2991166590","https://openalex.org/W6636486754","https://openalex.org/W6665080911"],"related_works":["https://openalex.org/W3172150420","https://openalex.org/W2107725657","https://openalex.org/W2112121444","https://openalex.org/W2509452605","https://openalex.org/W3112689649","https://openalex.org/W2148608945","https://openalex.org/W2101020326","https://openalex.org/W2808535280","https://openalex.org/W3122821775","https://openalex.org/W3204654320"],"abstract_inverted_index":{"In":[0,61],"many":[1],"applications,":[2],"the":[3,6,16,64,100,105,112,134,141,148,151,163,178,184,204],"logic":[4],"of":[5,22,107,136,150,162],"program":[7,159],"can":[8,66,187],"be":[9,41,67],"described":[10],"using":[11],"a":[12,156,166,197],"task":[13,24,65,209],"graph,":[14],"where":[15,114,128],"data":[17],"dependencies":[18,28],"and":[19,72,133,172,201],"execution":[20],"time":[21],"each":[23],"are":[25,35,95,117,138],"described.":[26],"These":[27],"create":[29],"precedence":[30,93,126],"constraints":[31,94],"among":[32],"tasks,":[33],"which":[34],"requirements":[36],"that":[37,56,85,92,99,120,183],"some":[38,44,62],"tasks":[39,55,124,137],"must":[40],"finished":[42],"before":[43],"other":[45],"tasks.":[46],"Many":[47],"efforts":[48],"have":[49],"been":[50],"put":[51],"into":[52,69],"scheduling":[53,122],"parallelizable":[54],"synchronically":[57],"use":[58],"multiple":[59],"cores.":[60],"cases,":[63],"chunked":[68],"smaller":[70],"pieces":[71],"scheduled":[73],"independently,":[74],"allowing":[75],"further":[76],"flexible":[77],"schedules.":[78],"However,":[79],"it":[80,202],"is":[81,121,145,170,175],"usually":[82],"either":[83],"assumed":[84],"such":[86],"splitting":[87,129,135],"has":[88,102,203],"no":[89],"overhead,":[90],"or":[91,98],"not":[96],"present,":[97],"user":[101],"to":[103,146,206],"provide":[104],"way":[106],"splitting.":[108],"This":[109],"paper":[110],"addresses":[111],"problem":[113],"these":[115],"factors":[116],"considered":[118],"together,":[119],"splittable":[123],"with":[125,177,193],"constraints,":[127],"introduces":[130],"an":[131],"overhead":[132],"determined":[139],"by":[140],"algorithm.":[142],"The":[143],"objective":[144],"minimize":[147],"makespan":[149],"schedule.":[152],"We":[153,181],"first":[154],"present":[155],"mixed-integer":[157],"quadratic":[158],"(MIQP)":[160],"formulation":[161],"problem.":[164],"Then,":[165],"genetic":[167,185],"algorithm":[168,186],"(GA)":[169],"devised":[171],"its":[173],"performance":[174],"compared":[176,192],"MIQP":[179,194],"solutions.":[180],"show":[182],"produce":[188],"reasonably":[189],"good":[190],"schedules":[191],"output":[195],"within":[196],"significantly":[198],"shorter":[199],"time,":[200],"potential":[205],"handle":[207],"large":[208],"graphs.":[210]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}