考虑顺序相关设置时间的供应链多阶段生产系统与运输集成调度

N. Bagheri Rad, P. Samouei
{"title":"考虑顺序相关设置时间的供应链多阶段生产系统与运输集成调度","authors":"N. Bagheri Rad, P. Samouei","doi":"10.52547/jimp.11.3.181","DOIUrl":null,"url":null,"abstract":"In this research, an integrated scheduling problem of job shop systems with an assembly stage and transportation to minimize the total tardiness time is studied. In this problem, the parts are processed in a job shop system and then assembled in the assembly stage. Ultimately, the products are shipped in packages to customers. Setup time is assumed to depend on sequence. At first, a mixed-integer linear model is developed. Since the problem is NP-hard, a hybrid imperialist competitive and simulated annealing (ICA-SA) algorithm is proposed to solve the problems with the medium and large sizes. To validate the performance of the proposed algorithm, results are compared to an imperialist competitive algorithm and a hybrid imperialist competitive and tabu search (ICA-TS) algorithm. Analysis of variance random block design is used to compare the results of the algorithms. P-values of algorithms and blocks in this test are smaller than the significance level of 0.05. The computational results show that the proposed hybrid algorithm achieves better performance than the imperialist competitive algorithm and hybrid imperialist competitive and tabu search.","PeriodicalId":303885,"journal":{"name":"Journal of Industrial Management Perspective","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Integrated Scheduling of Multi-Stage Production System and Transportation in the Supply Chain by Considering the Sequence Dependent Setup Time\",\"authors\":\"N. Bagheri Rad, P. Samouei\",\"doi\":\"10.52547/jimp.11.3.181\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this research, an integrated scheduling problem of job shop systems with an assembly stage and transportation to minimize the total tardiness time is studied. In this problem, the parts are processed in a job shop system and then assembled in the assembly stage. Ultimately, the products are shipped in packages to customers. Setup time is assumed to depend on sequence. At first, a mixed-integer linear model is developed. Since the problem is NP-hard, a hybrid imperialist competitive and simulated annealing (ICA-SA) algorithm is proposed to solve the problems with the medium and large sizes. To validate the performance of the proposed algorithm, results are compared to an imperialist competitive algorithm and a hybrid imperialist competitive and tabu search (ICA-TS) algorithm. Analysis of variance random block design is used to compare the results of the algorithms. P-values of algorithms and blocks in this test are smaller than the significance level of 0.05. The computational results show that the proposed hybrid algorithm achieves better performance than the imperialist competitive algorithm and hybrid imperialist competitive and tabu search.\",\"PeriodicalId\":303885,\"journal\":{\"name\":\"Journal of Industrial Management Perspective\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-09-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Industrial Management Perspective\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.52547/jimp.11.3.181\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Industrial Management Perspective","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.52547/jimp.11.3.181","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文研究了具有装配阶段和运输的作业车间系统的集成调度问题,以使总延误时间最小化。在该问题中,零件在作业车间系统中进行加工,然后在装配阶段进行组装。最终,产品被打包运送给客户。假定设置时间取决于序列。首先,建立了混合整数线性模型。由于问题是np困难的,提出了一种混合帝国主义竞争和模拟退火(ICA-SA)算法来解决中、大尺寸的问题。为了验证所提出算法的性能,将结果与帝国主义竞争算法和混合帝国主义竞争和禁忌搜索(ICA-TS)算法进行比较。采用方差分析随机块设计来比较算法的结果。本检验中算法和块的p值均小于0.05的显著性水平。计算结果表明,所提出的混合算法比帝国竞争算法和帝国竞争与禁忌搜索的混合算法取得了更好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Integrated Scheduling of Multi-Stage Production System and Transportation in the Supply Chain by Considering the Sequence Dependent Setup Time
In this research, an integrated scheduling problem of job shop systems with an assembly stage and transportation to minimize the total tardiness time is studied. In this problem, the parts are processed in a job shop system and then assembled in the assembly stage. Ultimately, the products are shipped in packages to customers. Setup time is assumed to depend on sequence. At first, a mixed-integer linear model is developed. Since the problem is NP-hard, a hybrid imperialist competitive and simulated annealing (ICA-SA) algorithm is proposed to solve the problems with the medium and large sizes. To validate the performance of the proposed algorithm, results are compared to an imperialist competitive algorithm and a hybrid imperialist competitive and tabu search (ICA-TS) algorithm. Analysis of variance random block design is used to compare the results of the algorithms. P-values of algorithms and blocks in this test are smaller than the significance level of 0.05. The computational results show that the proposed hybrid algorithm achieves better performance than the imperialist competitive algorithm and hybrid imperialist competitive and tabu search.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信