.png){kind=icon}
返回
A genetic-algorithm-based heuristic for the GT cell formation problem
.png){kind=icon}
PRE
AI
DOI：10.1016/0360-8352(96)00044-7.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents a heuristic for the machine-part grouping problem which incorporates relevant production requirements such as routing sequence, production volume, unit handling size, unit processing time and cell size. The heuristic consists of two phases. The first phase is developed based on a genetic algorithm and greedy heuristic to solve the machine grouping problem. Once machine cells are identified, the second phase is employed to identify the associated part families. The performance of the heuristic is examined through a comparative study with some existing solution methods. Global efficiency, group efficiency, intercell move factor and grouping effectiveness are adopted as comparative measures. Copyright (C) 1996 Elsevier Science Ltd
Keyword:
GROUP TECHNOLOGY
CLUSTERING-ALGORITHM
MANUFACTURING SYSTEM
DESIGN
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
查看更多内容