M. Mezmaz, Y. Kessaci, Young Choon Lee, N. Melab, E. Talbi, Albert Y. Zomaya, D. Tuyttens
{"title":"一种基于并行岛的混合遗传算法，用于优先级约束应用，以最小化能耗和完工时间","authors":"M. Mezmaz, Y. Kessaci, Young Choon Lee, N. Melab, E. Talbi, Albert Y. Zomaya, D. Tuyttens","doi":"10.1109/GRID.2010.5697985","DOIUrl":null,"url":null,"abstract":"Task scheduling algorithms are designed mostly with the sole goal of minimizing makespan (completion time). Almost all research works related to this kind of algorithms do not pay much attention to energy consumption.","PeriodicalId":6372,"journal":{"name":"2010 11th IEEE/ACM International Conference on Grid Computing","volume":"40 1","pages":"274-281"},"PeriodicalIF":0.0000,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"A parallel island-based hybrid genetic algorithm for precedence-constrained applications to minimize energy consumption and makespan\",\"authors\":\"M. Mezmaz, Y. Kessaci, Young Choon Lee, N. Melab, E. Talbi, Albert Y. Zomaya, D. Tuyttens\",\"doi\":\"10.1109/GRID.2010.5697985\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Task scheduling algorithms are designed mostly with the sole goal of minimizing makespan (completion time). Almost all research works related to this kind of algorithms do not pay much attention to energy consumption.\",\"PeriodicalId\":6372,\"journal\":{\"name\":\"2010 11th IEEE/ACM International Conference on Grid Computing\",\"volume\":\"40 1\",\"pages\":\"274-281\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 11th IEEE/ACM International Conference on Grid Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GRID.2010.5697985\",\"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 11th IEEE/ACM International Conference on Grid Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GRID.2010.5697985","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A parallel island-based hybrid genetic algorithm for precedence-constrained applications to minimize energy consumption and makespan
Task scheduling algorithms are designed mostly with the sole goal of minimizing makespan (completion time). Almost all research works related to this kind of algorithms do not pay much attention to energy consumption.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
