结合车间装配作业的设施布局设计和动态路线设计

Lihui Wang
{"title":"结合车间装配作业的设施布局设计和动态路线设计","authors":"Lihui Wang","doi":"10.1109/ISAM.2011.5942302","DOIUrl":null,"url":null,"abstract":"This paper presents a hybrid approach for facility layout redesign and dynamic job routing. More specifically, based on the source of uncertainty, the facility layout problem is split into two sub-problems and dealt with by two modules: re-layoutand find-route. Genetic algorithm is used where changes may cause a layout redesign of the entire shop, while function blocks are utilised to find the best sequence of robots for the new conditions within the existing layout. The method is verified in a case study of a hypothetic robotic assembly shop.","PeriodicalId":273573,"journal":{"name":"2011 IEEE International Symposium on Assembly and Manufacturing (ISAM)","volume":"207 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Combining facility layout redesign and dynamic routing for job-shop assembly operations\",\"authors\":\"Lihui Wang\",\"doi\":\"10.1109/ISAM.2011.5942302\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a hybrid approach for facility layout redesign and dynamic job routing. More specifically, based on the source of uncertainty, the facility layout problem is split into two sub-problems and dealt with by two modules: re-layoutand find-route. Genetic algorithm is used where changes may cause a layout redesign of the entire shop, while function blocks are utilised to find the best sequence of robots for the new conditions within the existing layout. The method is verified in a case study of a hypothetic robotic assembly shop.\",\"PeriodicalId\":273573,\"journal\":{\"name\":\"2011 IEEE International Symposium on Assembly and Manufacturing (ISAM)\",\"volume\":\"207 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-05-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE International Symposium on Assembly and Manufacturing (ISAM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISAM.2011.5942302\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE International Symposium on Assembly and Manufacturing (ISAM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISAM.2011.5942302","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

提出了一种设施布局重新设计与动态作业调度的混合方法。具体地说,根据不确定性的来源,将设施布局问题分解为两个子问题,分别用重新布局和寻路两个模块来处理。遗传算法用于可能导致整个车间布局重新设计的变化,而功能块用于在现有布局中找到适合新条件的最佳机器人序列。最后以一个机器人装配车间为例,对该方法进行了验证。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Combining facility layout redesign and dynamic routing for job-shop assembly operations
This paper presents a hybrid approach for facility layout redesign and dynamic job routing. More specifically, based on the source of uncertainty, the facility layout problem is split into two sub-problems and dealt with by two modules: re-layoutand find-route. Genetic algorithm is used where changes may cause a layout redesign of the entire shop, while function blocks are utilised to find the best sequence of robots for the new conditions within the existing layout. The method is verified in a case study of a hypothetic robotic assembly shop.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信