定期预防性维修的多目标优化

Amir Ebrahimi Zade, Sasan Barak, Hamidreza Maghsoudlou, M. Toloo
{"title":"定期预防性维修的多目标优化","authors":"Amir Ebrahimi Zade, Sasan Barak, Hamidreza Maghsoudlou, M. Toloo","doi":"10.1109/IESM.2015.7380154","DOIUrl":null,"url":null,"abstract":"This article investigates a JIT single machine scheduling problem with a periodic preventive maintenance. Also to maintain the quality of the products, there is a limitation on the maximum number of allowable jobs in each period. The proposed bi-objective mixed integer model minimizes total earliness-tardiness and makespan simultaneously. Due to the computational complexity of the problem, multi-objective particle swarm optimization (MOPSO) algorithm is implemented. Also, as well as MOPSO, two other optimization algorithms are used for comparing the results. Eventually, Taguchi method with metrics analysis is presented to tune the algorithms' parameters and a multiple criterion decision making (MCDM) technique based on the technique for order of preference by similarity to ideal solution (TOPSIS) is applied to choose the best algorithm. Comparison results confirmed supremacy of MOPSO to the other algorithms.","PeriodicalId":308675,"journal":{"name":"2015 International Conference on Industrial Engineering and Systems Management (IESM)","volume":"96 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Multi-objective optimization for periodic preventive maintenance\",\"authors\":\"Amir Ebrahimi Zade, Sasan Barak, Hamidreza Maghsoudlou, M. Toloo\",\"doi\":\"10.1109/IESM.2015.7380154\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This article investigates a JIT single machine scheduling problem with a periodic preventive maintenance. Also to maintain the quality of the products, there is a limitation on the maximum number of allowable jobs in each period. The proposed bi-objective mixed integer model minimizes total earliness-tardiness and makespan simultaneously. Due to the computational complexity of the problem, multi-objective particle swarm optimization (MOPSO) algorithm is implemented. Also, as well as MOPSO, two other optimization algorithms are used for comparing the results. Eventually, Taguchi method with metrics analysis is presented to tune the algorithms' parameters and a multiple criterion decision making (MCDM) technique based on the technique for order of preference by similarity to ideal solution (TOPSIS) is applied to choose the best algorithm. Comparison results confirmed supremacy of MOPSO to the other algorithms.\",\"PeriodicalId\":308675,\"journal\":{\"name\":\"2015 International Conference on Industrial Engineering and Systems Management (IESM)\",\"volume\":\"96 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 International Conference on Industrial Engineering and Systems Management (IESM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IESM.2015.7380154\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 International Conference on Industrial Engineering and Systems Management (IESM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IESM.2015.7380154","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文研究了具有定期预防性维护的JIT单机调度问题。另外,为了保持产品的质量,每个周期内允许的最大作业数量是有限制的。提出的双目标混合整数模型使总早迟到和总完工时间同时最小化。由于问题的计算复杂性,采用了多目标粒子群优化(MOPSO)算法。此外,除了MOPSO之外,还使用了另外两种优化算法来比较结果。最后,提出了带有度量分析的田口方法来调整算法的参数,并采用基于理想解相似性偏好排序技术的多准则决策技术来选择最佳算法。比较结果证实了MOPSO算法优于其他算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Multi-objective optimization for periodic preventive maintenance
This article investigates a JIT single machine scheduling problem with a periodic preventive maintenance. Also to maintain the quality of the products, there is a limitation on the maximum number of allowable jobs in each period. The proposed bi-objective mixed integer model minimizes total earliness-tardiness and makespan simultaneously. Due to the computational complexity of the problem, multi-objective particle swarm optimization (MOPSO) algorithm is implemented. Also, as well as MOPSO, two other optimization algorithms are used for comparing the results. Eventually, Taguchi method with metrics analysis is presented to tune the algorithms' parameters and a multiple criterion decision making (MCDM) technique based on the technique for order of preference by similarity to ideal solution (TOPSIS) is applied to choose the best algorithm. Comparison results confirmed supremacy of MOPSO to the other algorithms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信