Minimizing Completion Time of Processing and Assembly Operations Using Simulated Annealing

Shuangquan Hu, Jufeng Wang
{"title":"Minimizing Completion Time of Processing and Assembly Operations Using Simulated Annealing","authors":"Shuangquan Hu, Jufeng Wang","doi":"10.1109/ICNSC52481.2021.9702253","DOIUrl":null,"url":null,"abstract":"This paper aims to study the problem of minimizing the completion time of a product in a cellular manufacturing system with multiple processing cells and a single assembly cell. Some types of parallel machines are involved in the processing cells, and parts are allowed to move among cells. A new model is developed for simultaneous processing and assembly. To find the optimal solution of this model, a structure of the solution is designed and a simulated annealing algorithm (SA) is developed. Numerical experiments show that our proposed model takes significantly less time than a model in which all parts are processed and then assembled.","PeriodicalId":129062,"journal":{"name":"2021 IEEE International Conference on Networking, Sensing and Control (ICNSC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE International Conference on Networking, Sensing and Control (ICNSC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNSC52481.2021.9702253","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper aims to study the problem of minimizing the completion time of a product in a cellular manufacturing system with multiple processing cells and a single assembly cell. Some types of parallel machines are involved in the processing cells, and parts are allowed to move among cells. A new model is developed for simultaneous processing and assembly. To find the optimal solution of this model, a structure of the solution is designed and a simulated annealing algorithm (SA) is developed. Numerical experiments show that our proposed model takes significantly less time than a model in which all parts are processed and then assembled.
利用模拟退火最小化加工和装配操作的完成时间
本文旨在研究具有多个加工单元和单个装配单元的元胞制造系统中产品完成时间的最小化问题。某些类型的并行机器涉及到加工单元,零件被允许在单元之间移动。提出了一种同时加工装配的新模型。为了找到该模型的最优解,设计了解的结构并提出了模拟退火算法(SA)。数值实验表明,该模型比所有零件加工后组装的模型所需的时间要少得多。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信