Balancing of parallel U-shaped assembly lines with a heuristic algorithm based on bidirectional priority values

Yuling Jiao, Xue Deng, Mingjuan Li, Xiaocui Xing, Binjie Xu
{"title":"Balancing of parallel U-shaped assembly lines with a heuristic algorithm based on bidirectional priority values","authors":"Yuling Jiao, Xue Deng, Mingjuan Li, Xiaocui Xing, Binjie Xu","doi":"10.1177/1063293X211065506","DOIUrl":null,"url":null,"abstract":"Aiming at improving assembly line efficiency and flexibility, a balancing method of parallel U-shaped assembly line system is proposed. Based on the improved product priority diagram, the bidirectional priority value formula is obtained. Then, assembly lines are partitioned into z-q partitions and workstations are defined. After that, the mathematical model of the parallel U-shaped assembly line balancing problem is established. A heuristic algorithm based on bidirectional priority values is used to solve explanatory examples and test examples. It can be seen from the results and the effect indicators of the assembly line balancing problem that the heuristic algorithm is suitable for large balancing problems. The proposed method has higher calculation accuracy and shorter calculation time. The balancing effect of the parallel U-shaped assembly line is better than that of single U-shaped assembly line, which verifies the superiority of the parallel U-type assembly line and effectiveness of the proposed method. It provides a theoretical and practical reference for parallel U-type assembly line balancing problem.","PeriodicalId":10680,"journal":{"name":"Concurrent Engineering","volume":"21 1","pages":"80 - 92"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Concurrent Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1177/1063293X211065506","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Aiming at improving assembly line efficiency and flexibility, a balancing method of parallel U-shaped assembly line system is proposed. Based on the improved product priority diagram, the bidirectional priority value formula is obtained. Then, assembly lines are partitioned into z-q partitions and workstations are defined. After that, the mathematical model of the parallel U-shaped assembly line balancing problem is established. A heuristic algorithm based on bidirectional priority values is used to solve explanatory examples and test examples. It can be seen from the results and the effect indicators of the assembly line balancing problem that the heuristic algorithm is suitable for large balancing problems. The proposed method has higher calculation accuracy and shorter calculation time. The balancing effect of the parallel U-shaped assembly line is better than that of single U-shaped assembly line, which verifies the superiority of the parallel U-type assembly line and effectiveness of the proposed method. It provides a theoretical and practical reference for parallel U-type assembly line balancing problem.
基于双向优先级值的启发式并行u型装配线平衡算法
为了提高装配线的效率和灵活性,提出了一种平行u型装配线系统的平衡方法。基于改进后的产品优先级图,得到了双向优先级值公式。然后,将装配线划分为z-q个分区,并定义工作站。在此基础上,建立了平行u型装配线平衡问题的数学模型。采用基于双向优先级值的启发式算法求解解释性实例和测试实例。从装配线平衡问题的结果和效果指标可以看出,启发式算法适用于大型平衡问题。该方法具有较高的计算精度和较短的计算时间。并联u型装配线的平衡效果优于单u型装配线,验证了并联u型装配线的优越性和所提方法的有效性。为解决平行u型装配线平衡问题提供了理论和实践参考。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信