{"id":"https://openalex.org/W2899152924","doi":"https://doi.org/10.1109/etfa.2018.8502515","title":"Genetic Algorithm for Scheduling Time-Triggered Traffic in Time-Sensitive Networks","display_name":"Genetic Algorithm for Scheduling Time-Triggered Traffic in Time-Sensitive Networks","publication_year":2018,"publication_date":"2018-09-01","ids":{"openalex":"https://openalex.org/W2899152924","doi":"https://doi.org/10.1109/etfa.2018.8502515","mag":"2899152924"},"language":"en","primary_location":{"id":"doi:10.1109/etfa.2018.8502515","is_oa":false,"landing_page_url":"https://doi.org/10.1109/etfa.2018.8502515","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE 23rd International Conference on Emerging Technologies and Factory Automation (ETFA)","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/A5055628357","display_name":"Maryam Pahlevan","orcid":null},"institutions":[{"id":"https://openalex.org/I206895457","display_name":"University of Siegen","ror":"https://ror.org/02azyry73","country_code":"DE","type":"education","lineage":["https://openalex.org/I206895457"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Maryam Pahlevan","raw_affiliation_strings":["University of Siegen, Siegen, Germany"],"affiliations":[{"raw_affiliation_string":"University of Siegen, Siegen, Germany","institution_ids":["https://openalex.org/I206895457"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007015294","display_name":"Roman Obermaisser","orcid":"https://orcid.org/0009-0002-4483-1503"},"institutions":[{"id":"https://openalex.org/I206895457","display_name":"University of Siegen","ror":"https://ror.org/02azyry73","country_code":"DE","type":"education","lineage":["https://openalex.org/I206895457"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Roman Obermaisser","raw_affiliation_strings":["University of Siegen, Siegen, Germany"],"affiliations":[{"raw_affiliation_string":"University of Siegen, Siegen, Germany","institution_ids":["https://openalex.org/I206895457"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5055628357"],"corresponding_institution_ids":["https://openalex.org/I206895457"],"apc_list":null,"apc_paid":null,"fwci":3.899,"has_fulltext":false,"cited_by_count":105,"citation_normalized_percentile":{"value":0.94148363,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"337","last_page":"344"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12216","display_name":"Network Time Synchronization Technologies","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/T12216","display_name":"Network Time Synchronization Technologies","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/T10933","display_name":"Real-Time Systems Scheduling","score":0.9812999963760376,"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/T11125","display_name":"Petri Nets in System Modeling","score":0.9574999809265137,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.7532727718353271},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.65105140209198},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.6402570009231567},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.6155995726585388},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.5767889618873596},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.5755850076675415},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.5581251978874207},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.5194489359855652},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4924519956111908},{"id":"https://openalex.org/keywords/genetic-algorithm-scheduling","display_name":"Genetic algorithm scheduling","score":0.43438443541526794},{"id":"https://openalex.org/keywords/fixed-priority-pre-emptive-scheduling","display_name":"Fixed-priority pre-emptive scheduling","score":0.41624945402145386},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3793117105960846},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2962908446788788},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10299938917160034}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7532727718353271},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.65105140209198},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.6402570009231567},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.6155995726585388},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.5767889618873596},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.5755850076675415},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.5581251978874207},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.5194489359855652},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4924519956111908},{"id":"https://openalex.org/C159022435","wikidata":"https://www.wikidata.org/wiki/Q5532874","display_name":"Genetic algorithm scheduling","level":5,"score":0.43438443541526794},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.41624945402145386},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3793117105960846},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2962908446788788},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10299938917160034},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/etfa.2018.8502515","is_oa":false,"landing_page_url":"https://doi.org/10.1109/etfa.2018.8502515","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE 23rd International Conference on Emerging Technologies and Factory Automation (ETFA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.41999998688697815,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W392567011","https://openalex.org/W2128637218","https://openalex.org/W2527886332","https://openalex.org/W2535850491","https://openalex.org/W2552372042","https://openalex.org/W2625820481","https://openalex.org/W2768086256","https://openalex.org/W3146120420","https://openalex.org/W6739747207"],"related_works":["https://openalex.org/W4300092030","https://openalex.org/W1545991362","https://openalex.org/W2184166483","https://openalex.org/W3184267879","https://openalex.org/W2167574351","https://openalex.org/W2404383452","https://openalex.org/W2741059494","https://openalex.org/W2895871327","https://openalex.org/W2134269501","https://openalex.org/W4244749153"],"abstract_inverted_index":{"Time-Sensitive":[0],"Networking":[1],"(TSN)":[2],"is":[3,116,139],"introduced":[4],"as":[5],"a":[6,63,78,84,104,177],"series":[7],"of":[8,16,30,36,46,58,66,108,151,158,180],"Ethernet":[9],"extensions":[10],"to":[11,61,127,166,189],"address":[12],"strict":[13],"temporal":[14],"constraints":[15,94,102,123],"modern":[17],"mission-critical":[18],"applications.":[19],"TSN":[20],"offers":[21],"determinism":[22],"using":[23,100],"global":[24,64,98],"Time-Triggered":[25],"(TT)":[26],"transmission":[27,183],"schedules.":[28],"Most":[29],"existing":[31],"scheduling":[32,39,51,80,93,109,122,163],"solutions":[33],"ignore":[34],"interdependence":[35],"routing":[37,91,120],"and":[38,41,92,95,121,156,170,185],"problems":[40],"derive":[42],"the":[43,56,90,112,128,133,137,149,162,173,190],"design":[44,113],"space":[45,114],"system":[47],"implementations":[48],"only":[49,131],"from":[50,118],"constraints.":[52],"This":[53],"strategy":[54],"limits":[55],"capability":[57],"former":[59],"approaches":[60,129],"compute":[62],"schedule":[65],"TT":[67,159,182],"communication":[68],"for":[69],"several":[70],"real-time":[71,152],"systems.":[72],"In":[73],"this":[74],"paper,":[75],"we":[76],"present":[77],"heuristic":[79],"approach":[81,88,146],"based":[82],"on":[83],"genetic":[85],"algorithm.":[86],"Our":[87,144],"combines":[89],"generates":[96],"static":[97],"schedules":[99],"joint":[101,119],"in":[103,125,161],"single-step.":[105],"The":[106],"number":[107],"possibilities":[110],"within":[111],"that":[115,130],"derived":[117],"increases":[124],"comparison":[126],"use":[132],"fixed":[134],"routing.":[135],"Thereby,":[136],"schedulability":[138],"improved":[140],"by":[141],"our":[142],"solution.":[143],"genetic-based":[145],"also":[147],"considers":[148],"distribution":[150],"applications,":[153],"multicast":[154],"patterns":[155],"interdependencies":[157],"flows":[160],"process.":[164],"Due":[165],"optimized":[167],"task":[168],"binding":[169],"resource":[171,186],"allocation,":[172],"experimental":[174],"results":[175],"show":[176],"significant":[178],"enhancement":[179],"schedulability,":[181],"efficiency":[184],"utilization":[187],"compared":[188],"state-of-art":[191],"solutions.":[192]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":19},{"year":2024,"cited_by_count":23},{"year":2023,"cited_by_count":22},{"year":2022,"cited_by_count":20},{"year":2021,"cited_by_count":15},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1}],"updated_date":"2026-03-12T08:34:05.389933","created_date":"2025-10-10T00:00:00"}