{"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}
引用次数: 4
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
