{"title":"优化参数改进启发式方法:更多更好的NP-hard实时问题的解决方案","authors":"E. Ferro, Jorge Santos, J. Orozco, R. Cayssials","doi":"10.1109/EMWRTS.1996.557788","DOIUrl":null,"url":null,"abstract":"The paper presents a tuned heuristic method to solve the NP-hard problem of assigning a set of preemptible tasks with placement, resource, communication, time and precedence constraints to a set of heterogeneous processors. Depending on the tuning parameters, two versions are described. They produce more and better (e.g. with a less loaded communication network) solutions than the untuned version. Time to obtain the first solution and the number of solutions found for different known problems are given.","PeriodicalId":262733,"journal":{"name":"Proceedings of the Eighth Euromicro Workshop on Real-Time Systems","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Tuning parameters to improve a heuristic method: more and better solutions to an NP-hard real-time problem\",\"authors\":\"E. Ferro, Jorge Santos, J. Orozco, R. Cayssials\",\"doi\":\"10.1109/EMWRTS.1996.557788\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper presents a tuned heuristic method to solve the NP-hard problem of assigning a set of preemptible tasks with placement, resource, communication, time and precedence constraints to a set of heterogeneous processors. Depending on the tuning parameters, two versions are described. They produce more and better (e.g. with a less loaded communication network) solutions than the untuned version. Time to obtain the first solution and the number of solutions found for different known problems are given.\",\"PeriodicalId\":262733,\"journal\":{\"name\":\"Proceedings of the Eighth Euromicro Workshop on Real-Time Systems\",\"volume\":\"40 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-06-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Eighth Euromicro Workshop on Real-Time Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EMWRTS.1996.557788\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Eighth Euromicro Workshop on Real-Time Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EMWRTS.1996.557788","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Tuning parameters to improve a heuristic method: more and better solutions to an NP-hard real-time problem
The paper presents a tuned heuristic method to solve the NP-hard problem of assigning a set of preemptible tasks with placement, resource, communication, time and precedence constraints to a set of heterogeneous processors. Depending on the tuning parameters, two versions are described. They produce more and better (e.g. with a less loaded communication network) solutions than the untuned version. Time to obtain the first solution and the number of solutions found for different known problems are given.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
