{"title":"单机总加权延迟调度问题的协同求解器","authors":"Lamiche Chaabane","doi":"10.1109/ISPS.2018.8379016","DOIUrl":null,"url":null,"abstract":"In this paper, we aim to present a novel efficient approach called improved genetic simulated annealing algorithm (IGASA) in order to minimize the total weighted tardiness of n jobs on a single machine, which is recognized in the literature as a strong NP-hard Problem. The proposed model takes advantages of the genetic algorithm (GA) as a global search strategy and the capability of the improved simulated annealing (ISA) technique to improve solution quality in local regions. Experimental results on a set of benchmarks demonstrated the potent of our developed algorithm to find a good solutions which are significantly outperforms some other published works.","PeriodicalId":401258,"journal":{"name":"2017 First International Conference on Embedded & Distributed Systems (EDiS)","volume":"120 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A cooperative solver for single machine total weighted tardiness scheduling problem\",\"authors\":\"Lamiche Chaabane\",\"doi\":\"10.1109/ISPS.2018.8379016\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we aim to present a novel efficient approach called improved genetic simulated annealing algorithm (IGASA) in order to minimize the total weighted tardiness of n jobs on a single machine, which is recognized in the literature as a strong NP-hard Problem. The proposed model takes advantages of the genetic algorithm (GA) as a global search strategy and the capability of the improved simulated annealing (ISA) technique to improve solution quality in local regions. Experimental results on a set of benchmarks demonstrated the potent of our developed algorithm to find a good solutions which are significantly outperforms some other published works.\",\"PeriodicalId\":401258,\"journal\":{\"name\":\"2017 First International Conference on Embedded & Distributed Systems (EDiS)\",\"volume\":\"120 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 First International Conference on Embedded & Distributed Systems (EDiS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISPS.2018.8379016\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 First International Conference on Embedded & Distributed Systems (EDiS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPS.2018.8379016","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A cooperative solver for single machine total weighted tardiness scheduling problem
In this paper, we aim to present a novel efficient approach called improved genetic simulated annealing algorithm (IGASA) in order to minimize the total weighted tardiness of n jobs on a single machine, which is recognized in the literature as a strong NP-hard Problem. The proposed model takes advantages of the genetic algorithm (GA) as a global search strategy and the capability of the improved simulated annealing (ISA) technique to improve solution quality in local regions. Experimental results on a set of benchmarks demonstrated the potent of our developed algorithm to find a good solutions which are significantly outperforms some other published works.