{"title":"具有时序、优先级和排除约束的实时调度分散搜索","authors":"Adel Bouridah, H. Drias, Yacine Laalaoui","doi":"10.1109/ICMWI.2010.5648002","DOIUrl":null,"url":null,"abstract":"Tasks scheduling is one of the most important challenges in embedded hard-real-time systems. The problem is known to be NP-Hard and exhaustive search algorithms have no significant benefit in large-scale context. This paper proposes a scatter search based approach for mono-processor systems with timing, precedence and exclusion constraints with no preemption. An empirical study is undertaken and comparison is done with results of previous works.","PeriodicalId":404577,"journal":{"name":"2010 International Conference on Machine and Web Intelligence","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Scatter search for real-time scheduling with timing, precedence and exclusion constraints\",\"authors\":\"Adel Bouridah, H. Drias, Yacine Laalaoui\",\"doi\":\"10.1109/ICMWI.2010.5648002\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Tasks scheduling is one of the most important challenges in embedded hard-real-time systems. The problem is known to be NP-Hard and exhaustive search algorithms have no significant benefit in large-scale context. This paper proposes a scatter search based approach for mono-processor systems with timing, precedence and exclusion constraints with no preemption. An empirical study is undertaken and comparison is done with results of previous works.\",\"PeriodicalId\":404577,\"journal\":{\"name\":\"2010 International Conference on Machine and Web Intelligence\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-11-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 International Conference on Machine and Web Intelligence\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICMWI.2010.5648002\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Conference on Machine and Web Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMWI.2010.5648002","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Scatter search for real-time scheduling with timing, precedence and exclusion constraints
Tasks scheduling is one of the most important challenges in embedded hard-real-time systems. The problem is known to be NP-Hard and exhaustive search algorithms have no significant benefit in large-scale context. This paper proposes a scatter search based approach for mono-processor systems with timing, precedence and exclusion constraints with no preemption. An empirical study is undertaken and comparison is done with results of previous works.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
