装配线协同任务分配方法研究

IF 1.9 4区 计算机科学 Q3 AUTOMATION & CONTROL SYSTEMS
Weilei Shen, Qiangqiang Jiang, Yang Yang
{"title":"装配线协同任务分配方法研究","authors":"Weilei Shen, Qiangqiang Jiang, Yang Yang","doi":"10.1108/aa-08-2020-0114","DOIUrl":null,"url":null,"abstract":"\nPurpose\nThe purpose of this paper is to construct a task assignment model for U-shaped production lines with collaborative task, which is optimized by minimizing the number of workers and balancing the workload of the operators. The ultimate goal is to increase productivity by increasing the U-line balance and balancing the load on the operators.\n\n\nDesign/methodology/approach\nFirst, task selection and update mechanism are analyzed and the task selection mechanism suitable for collaborative task is proposed. Second, M-COMOSAL is obtained by improving the original COMOSAL. Finally, The M-COMOSAL algorithm and the COMAOSAL algorithm are used to perform job assignment on the double-acting clutch U-shaped assembly line.\n\n\nFindings\nAccording to the allocation scheme obtained by M-COMSOAL, the beat can be adjusted according to the change of order demand. The final allocation scheme is superior to the COMSOAL algorithm in terms of number of workers, working time, production tempo and balance rate. In particular, compared with the old scheme, the new scheme showed a decrease of 16.7% in the number of employees and a 18.8% increase in the production line balance rate. Thus, the method is helpful to reduce the number of operators and balance the workload.\n\n\nOriginality/value\nThe new algorithm proposed in this paper for the assignment of collaborative task can minimize the number of workers and balance the load of operators, which is of great significance for improving the balance rate of U-shaped production lines and the utilization of personnel or equipment.\n","PeriodicalId":55448,"journal":{"name":"Assembly Automation","volume":" ","pages":""},"PeriodicalIF":1.9000,"publicationDate":"2021-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Research on collaborative task assignment method of assembly line\",\"authors\":\"Weilei Shen, Qiangqiang Jiang, Yang Yang\",\"doi\":\"10.1108/aa-08-2020-0114\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\\nPurpose\\nThe purpose of this paper is to construct a task assignment model for U-shaped production lines with collaborative task, which is optimized by minimizing the number of workers and balancing the workload of the operators. The ultimate goal is to increase productivity by increasing the U-line balance and balancing the load on the operators.\\n\\n\\nDesign/methodology/approach\\nFirst, task selection and update mechanism are analyzed and the task selection mechanism suitable for collaborative task is proposed. Second, M-COMOSAL is obtained by improving the original COMOSAL. Finally, The M-COMOSAL algorithm and the COMAOSAL algorithm are used to perform job assignment on the double-acting clutch U-shaped assembly line.\\n\\n\\nFindings\\nAccording to the allocation scheme obtained by M-COMSOAL, the beat can be adjusted according to the change of order demand. The final allocation scheme is superior to the COMSOAL algorithm in terms of number of workers, working time, production tempo and balance rate. In particular, compared with the old scheme, the new scheme showed a decrease of 16.7% in the number of employees and a 18.8% increase in the production line balance rate. Thus, the method is helpful to reduce the number of operators and balance the workload.\\n\\n\\nOriginality/value\\nThe new algorithm proposed in this paper for the assignment of collaborative task can minimize the number of workers and balance the load of operators, which is of great significance for improving the balance rate of U-shaped production lines and the utilization of personnel or equipment.\\n\",\"PeriodicalId\":55448,\"journal\":{\"name\":\"Assembly Automation\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":1.9000,\"publicationDate\":\"2021-12-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Assembly Automation\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1108/aa-08-2020-0114\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"AUTOMATION & CONTROL SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Assembly Automation","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1108/aa-08-2020-0114","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 1

摘要

目的建立具有协同任务的U型生产线的任务分配模型,该模型通过最小化工人数量和平衡操作员工作量来进行优化。最终目标是通过增加U型线平衡和平衡操作员的负载来提高生产力。设计/方法论/方法首先,分析了任务选择和更新机制,提出了适合协同任务的任务选择机制。第二,M-COMOSAL是在原有COMOSAL的基础上改进得到的。最后,将M-COMOSAL算法和COMOSAL方法应用于双作用离合器U形装配线上的作业分配。Findings根据M-COMSOAL获得的分配方案,节拍可以根据订单需求的变化进行调整。最终的分配方案在工人数量、工作时间、生产节奏和平衡率方面优于COMSOAL算法。特别是,与旧方案相比,新方案的员工人数减少了16.7%,生产线平衡率增加了18.8%。因此,该方法有助于减少操作员数量和平衡工作量。独创性/价值本文提出的协同任务分配新算法可以最大限度地减少工人数量,平衡操作员的工作量,这对提高U型生产线的平衡率和人员或设备的利用率具有重要意义。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Research on collaborative task assignment method of assembly line
Purpose The purpose of this paper is to construct a task assignment model for U-shaped production lines with collaborative task, which is optimized by minimizing the number of workers and balancing the workload of the operators. The ultimate goal is to increase productivity by increasing the U-line balance and balancing the load on the operators. Design/methodology/approach First, task selection and update mechanism are analyzed and the task selection mechanism suitable for collaborative task is proposed. Second, M-COMOSAL is obtained by improving the original COMOSAL. Finally, The M-COMOSAL algorithm and the COMAOSAL algorithm are used to perform job assignment on the double-acting clutch U-shaped assembly line. Findings According to the allocation scheme obtained by M-COMSOAL, the beat can be adjusted according to the change of order demand. The final allocation scheme is superior to the COMSOAL algorithm in terms of number of workers, working time, production tempo and balance rate. In particular, compared with the old scheme, the new scheme showed a decrease of 16.7% in the number of employees and a 18.8% increase in the production line balance rate. Thus, the method is helpful to reduce the number of operators and balance the workload. Originality/value The new algorithm proposed in this paper for the assignment of collaborative task can minimize the number of workers and balance the load of operators, which is of great significance for improving the balance rate of U-shaped production lines and the utilization of personnel or equipment.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Assembly Automation
Assembly Automation 工程技术-工程:制造
CiteScore
4.30
自引率
14.30%
发文量
51
审稿时长
3.3 months
期刊介绍: Assembly Automation publishes peer reviewed research articles, technology reviews and specially commissioned case studies. Each issue includes high quality content covering all aspects of assembly technology and automation, and reflecting the most interesting and strategically important research and development activities from around the world. Because of this, readers can stay at the very forefront of industry developments. All research articles undergo rigorous double-blind peer review, and the journal’s policy of not publishing work that has only been tested in simulation means that only the very best and most practical research articles are included. This ensures that the material that is published has real relevance and value for commercial manufacturing and research organizations.
×
引用
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学术官方微信