{"id":"https://openalex.org/W2129884589","doi":"https://doi.org/10.1109/acc.2006.1655373","title":"Optimal scheduling of control tasks with state feedback resource allocation","display_name":"Optimal scheduling of control tasks with state feedback resource allocation","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W2129884589","doi":"https://doi.org/10.1109/acc.2006.1655373","mag":"2129884589"},"language":"en","primary_location":{"id":"doi:10.1109/acc.2006.1655373","is_oa":false,"landing_page_url":"https://doi.org/10.1109/acc.2006.1655373","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2006 American Control Conference","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/A5112231596","display_name":"Mohamed El Mongi Ben Ga\u00efd","orcid":null},"institutions":[{"id":"https://openalex.org/I4210154111","display_name":"Universit\u00e9 Gustave Eiffel","ror":"https://ror.org/03x42jk29","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210154111"]},{"id":"https://openalex.org/I12187552","display_name":"UniLaSalle Amiens (ESIEE-Amiens)","ror":"https://ror.org/03r13py57","country_code":"FR","type":"education","lineage":["https://openalex.org/I12187552"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"M.E.M. Ben Gaid","raw_affiliation_strings":["ESIEE, Cit\u00e9 Descartes, COSI Laboratory, Noisy-Le-Grand, France"],"affiliations":[{"raw_affiliation_string":"ESIEE, Cit\u00e9 Descartes, COSI Laboratory, Noisy-Le-Grand, France","institution_ids":["https://openalex.org/I12187552","https://openalex.org/I4210154111"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047719086","display_name":"Arben \u00c7ela","orcid":"https://orcid.org/0000-0001-5708-1743"},"institutions":[{"id":"https://openalex.org/I4210154111","display_name":"Universit\u00e9 Gustave Eiffel","ror":"https://ror.org/03x42jk29","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210154111"]},{"id":"https://openalex.org/I12187552","display_name":"UniLaSalle Amiens (ESIEE-Amiens)","ror":"https://ror.org/03r13py57","country_code":"FR","type":"education","lineage":["https://openalex.org/I12187552"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"A. Cela","raw_affiliation_strings":["ESIEE, Cit\u00e9 Descartes, COSI Laboratory, Noisy-Le-Grand, France"],"affiliations":[{"raw_affiliation_string":"ESIEE, Cit\u00e9 Descartes, COSI Laboratory, Noisy-Le-Grand, France","institution_ids":["https://openalex.org/I12187552","https://openalex.org/I4210154111"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084480136","display_name":"Yskandar Hamam","orcid":"https://orcid.org/0000-0002-9673-9189"},"institutions":[{"id":"https://openalex.org/I12187552","display_name":"UniLaSalle Amiens (ESIEE-Amiens)","ror":"https://ror.org/03r13py57","country_code":"FR","type":"education","lineage":["https://openalex.org/I12187552"]},{"id":"https://openalex.org/I4210154111","display_name":"Universit\u00e9 Gustave Eiffel","ror":"https://ror.org/03x42jk29","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210154111"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Y. Hamam","raw_affiliation_strings":["ESIEE, Cit\u00e9 Descartes, A2SI Laboratory, Noisy-Le-Grand, France"],"affiliations":[{"raw_affiliation_string":"ESIEE, Cit\u00e9 Descartes, A2SI Laboratory, Noisy-Le-Grand, France","institution_ids":["https://openalex.org/I12187552","https://openalex.org/I4210154111"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112373229","display_name":"Cosmin Ionete","orcid":null},"institutions":[{"id":"https://openalex.org/I97553796","display_name":"University of Craiova","ror":"https://ror.org/03s251g81","country_code":"RO","type":"education","lineage":["https://openalex.org/I97553796"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"C. Ionete","raw_affiliation_strings":["Faculty of Automation, Computers and Electronics, University of Craiova, Romania"],"affiliations":[{"raw_affiliation_string":"Faculty of Automation, Computers and Electronics, University of Craiova, Romania","institution_ids":["https://openalex.org/I97553796"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5112231596"],"corresponding_institution_ids":["https://openalex.org/I12187552","https://openalex.org/I4210154111"],"apc_list":null,"apc_paid":null,"fwci":4.4598,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.94905201,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"6 pp.","last_page":"6 pp."},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9998999834060669,"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9977999925613403,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9975000023841858,"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.7489125728607178},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6349309086799622},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.6157845854759216},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.5902146697044373},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5346450209617615},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5320174694061279},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.519309937953949},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5159221887588501},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5001239776611328},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.4909510910511017},{"id":"https://openalex.org/keywords/optimal-control","display_name":"Optimal control","score":0.47742900252342224},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.47127100825309753},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.4630145728588104},{"id":"https://openalex.org/keywords/genetic-algorithm-scheduling","display_name":"Genetic algorithm scheduling","score":0.4153617322444916},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10210028290748596},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07859310507774353}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7489125728607178},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6349309086799622},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.6157845854759216},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.5902146697044373},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5346450209617615},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5320174694061279},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.519309937953949},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5159221887588501},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5001239776611328},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.4909510910511017},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.47742900252342224},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.47127100825309753},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.4630145728588104},{"id":"https://openalex.org/C159022435","wikidata":"https://www.wikidata.org/wiki/Q5532874","display_name":"Genetic algorithm scheduling","level":5,"score":0.4153617322444916},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10210028290748596},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07859310507774353},{"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/acc.2006.1655373","is_oa":false,"landing_page_url":"https://doi.org/10.1109/acc.2006.1655373","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2006 American Control Conference","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":14,"referenced_works":["https://openalex.org/W1741559883","https://openalex.org/W1977985274","https://openalex.org/W2015841828","https://openalex.org/W2042106612","https://openalex.org/W2100257697","https://openalex.org/W2103622286","https://openalex.org/W2105143424","https://openalex.org/W2109923146","https://openalex.org/W2112086656","https://openalex.org/W2118898228","https://openalex.org/W2178841274","https://openalex.org/W2261330695","https://openalex.org/W2316994408","https://openalex.org/W7070345046"],"related_works":["https://openalex.org/W2741059494","https://openalex.org/W32630872","https://openalex.org/W2365679959","https://openalex.org/W4387445197","https://openalex.org/W2150034320","https://openalex.org/W2134269501","https://openalex.org/W4382280829","https://openalex.org/W131757205","https://openalex.org/W2146800915","https://openalex.org/W2083786771"],"abstract_inverted_index":{"In":[0,46],"a":[1,37],"large":[2],"category":[3],"of":[4,31,51,60,66,128],"embedded":[5],"systems,":[6],"computing":[7,44],"resources":[8],"are":[9],"limited.":[10],"Consequently,":[11],"they":[12],"need":[13],"to":[14,36,118,135],"be":[15,81,88],"exploited":[16],"as":[17,19],"efficiently":[18],"possible.":[20],"Many":[21],"research":[22],"works":[23],"have":[24],"demonstrated":[25],"that":[26,77],"considering":[27],"jointly":[28],"the":[29,42,49,52,64,67,97,115,120,126,129,137,143],"problems":[30],"control":[32,39,55,61,122,138],"and":[33,56,102,108],"scheduling":[34,59,149],"leads":[35],"better":[38],"performance,":[40],"given":[41],"same":[43],"resources.":[45],"this":[47,78],"paper,":[48],"problem":[50,79],"optimal":[53,98,121],"integrated":[54],"non-preemptive":[57,99],"off-line":[58,100],"tasks":[62],"in":[63,133],"sense":[65],"H/sub":[68],"2/":[69],"performance":[70,139],"criterion":[71],"is":[72,75,103,151],"addressed.":[73],"It":[74],"shown":[76],"can":[80,87],"decomposed":[82],"into":[83],"two":[84],"sub-problems":[85],"which":[86],"solved":[89,104],"separately.":[90],"The":[91,111],"first":[92,130],"sub-problem":[93,113],"aims":[94],"at":[95],"finding":[96],"schedule,":[101],"using":[105],"efficient":[106,147],"branch":[107],"bound":[109],"algorithms.":[110],"second":[112],"uses":[114],"lifting":[116],"technique":[117],"determine":[119],"gains,":[123],"based":[124],"on":[125],"solution":[127],"sub-problem.":[131],"Finally,":[132],"order":[134],"improve":[136],"by":[140],"dynamically":[141],"allocating":[142],"computational":[144],"resources,":[145],"an":[146],"on-line":[148],"heuristic":[150],"proposed.":[152]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}