{"id":"https://openalex.org/W1484964226","doi":"https://doi.org/10.1109/cec.2004.1330993","title":"Genetic list scheduling for soft real-time parallel applications","display_name":"Genetic list scheduling for soft real-time parallel applications","publication_year":2004,"publication_date":"2004-09-28","ids":{"openalex":"https://openalex.org/W1484964226","doi":"https://doi.org/10.1109/cec.2004.1330993","mag":"1484964226"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2004.1330993","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2004.1330993","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)","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/A5077577982","display_name":"Yoginder S. Dandass","orcid":null},"institutions":[{"id":"https://openalex.org/I99041443","display_name":"Mississippi State University","ror":"https://ror.org/0432jq872","country_code":"US","type":"education","lineage":["https://openalex.org/I4210141039","https://openalex.org/I99041443"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Y.S. Dandass","raw_affiliation_strings":["Department of Computer Science and Engineering, Mississippi State University, MS, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Mississippi State University, MS, USA","institution_ids":["https://openalex.org/I99041443"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5077577982"],"corresponding_institution_ids":["https://openalex.org/I99041443"],"apc_list":null,"apc_paid":null,"fwci":0.3217,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.50307004,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"cs 93 114","issue":null,"first_page":"1164","last_page":"1171"},"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.9980999827384949,"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/T10933","display_name":"Real-Time Systems Scheduling","score":0.9970999956130981,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.817457914352417},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6467404365539551},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.6360898017883301},{"id":"https://openalex.org/keywords/probability-distribution","display_name":"Probability distribution","score":0.4680323898792267},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.4407050311565399},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.4363633096218109},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4354921281337738},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3790503740310669},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.31332990527153015},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23895183205604553},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.1015881896018982},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09458687901496887}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.817457914352417},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6467404365539551},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.6360898017883301},{"id":"https://openalex.org/C149441793","wikidata":"https://www.wikidata.org/wiki/Q200726","display_name":"Probability distribution","level":2,"score":0.4680323898792267},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.4407050311565399},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4363633096218109},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4354921281337738},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3790503740310669},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.31332990527153015},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23895183205604553},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.1015881896018982},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09458687901496887},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2004.1330993","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2004.1330993","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W634463279","https://openalex.org/W1502596244","https://openalex.org/W1589975099","https://openalex.org/W1593549813","https://openalex.org/W1867797547","https://openalex.org/W2003526519","https://openalex.org/W2023753260","https://openalex.org/W2043331236","https://openalex.org/W2057108708","https://openalex.org/W2065689629","https://openalex.org/W2106897032","https://openalex.org/W2110250220","https://openalex.org/W2144482271","https://openalex.org/W2151038512","https://openalex.org/W2152819395","https://openalex.org/W2154390351","https://openalex.org/W6630148091","https://openalex.org/W6635336068","https://openalex.org/W6635542243"],"related_works":["https://openalex.org/W2731094954","https://openalex.org/W2789273959","https://openalex.org/W4302345037","https://openalex.org/W2952978498","https://openalex.org/W2951616510","https://openalex.org/W1998712144","https://openalex.org/W3122467582","https://openalex.org/W1763561501","https://openalex.org/W2890277969","https://openalex.org/W4200080306"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3,11,62,72],"hybrid":[4],"algorithm":[5,13],"that":[6],"combines":[7],"list":[8,58],"scheduling":[9,59],"with":[10],"genetic":[12],"for":[14,18,61,74],"constructing":[15],"nonpreemptive":[16],"schedules":[17,54,70],"soft":[19],"real-time":[20],"parallel":[21],"applications":[22],"represented":[23,43],"as":[24,44],"directed":[25],"acyclic":[26],"graphs.":[27],"The":[28,48],"execution":[29,84],"time":[30,85],"requirements":[31],"of":[32,64,78],"the":[33,68,76,79,83,90],"applications'":[34],"tasks":[35],"are":[36,42],"assumed":[37],"to":[38],"be":[39],"stochastic":[40,69],"and":[41],"probability":[45,77],"distribution":[46],"functions.":[47],"approach":[49],"presented":[50],"here":[51],"produces":[52],"shorter":[53],"than":[55,89],"two":[56],"popular":[57],"approaches":[60],"majority":[63],"sample":[65],"problems.":[66],"Furthermore,":[67],"provide":[71],"mechanism":[73],"predicting":[75],"application":[80],"completing":[81],"when":[82],"available":[86],"is":[87],"less":[88],"worst":[91],"case":[92],"requirement.":[93]},"counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}