单机总加权延迟调度问题的协同求解器

Lamiche Chaabane
{"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}
引用次数: 1

摘要

在本文中,我们的目标是提出一种新的高效方法,称为改进的遗传模拟退火算法(IGASA),以最小化单个机器上n个作业的总加权延迟,这在文献中被认为是一个强np困难问题。该模型利用遗传算法作为全局搜索策略和改进的模拟退火技术在局部区域提高求解质量的能力。在一组基准测试上的实验结果表明,我们开发的算法在找到好的解决方案方面的效力明显优于其他已发表的作品。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信