Formation of part family for reconfigurable manufacturing systems considering bypassing moves and idle machines

详细信息    查看全文

• 作者：Guo-xin Wang ^{wangguoxin@bit.edu.cn} ; Si-han Huang ; ^{535992068@qq.com} ; Xi-wen Shang ^{xiwenshang@sina.com} ; Yan Yan ^{yanyan331@bit.edu.cn} ; Jing-jun Du ^{dujj.ok@163.com}
• 关键词：Reconfigurable manufacturing system ; Part family ; Similarity coefficient ; Longest common subsequence ; Shortest composite supersequence
• 刊名：Journal of Manufacturing Systems
• 出版年：2016
• 出版时间：October 2016
• 年：2016
• 卷：41
• 期：Complete
• 页码：120-129
• 全文大小：1500 K
• 卷排序：41

文摘

A similarity coefficient algorithm for the formation of reconfigurable manufacturing systems part family is presented, which considers bypassing moves and idle machines. The longest common subsequence (LCS) among different part processes is identified and the shortest composite supersequence (SCS) based on LCS is constructed. LCS and SCS are used to model the problem of bypassing moves and idle machines and LCS is highlighted. The proposed algorithm has a higher accuracy and practicability with high discrimination capability for similarity.