.png){kind=icon}
返回
Solving machine loading problems in a flexible manufacturing system using a genetic algorithm based heuristic approach
.png){kind=icon}
PRE
AI
DOI：10.1080/002075400418298.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The machine-loading problem of a flexible manufacturing system (FMS) has been recognized as one of the most important planning problems. In this research, a Genetic Algorithm (GA) based heuristic is proposed to solve the machine loading problem of a random type FMS. The objective of the loading problems is to minimize the system unbalance and maximize the throughput, satisfying the technological constraints such as availability of machining time, and tool slots. The proposed GA-based heuristic determines the part type sequence and the operation-machine allocation that guarantee the optimal solution to the problem, rather than using fixed predetermined part sequencing rules. The efficiency of the proposed heuristic has been tested on ten sample problems and the results obtained have been compared with those of existing methods.
Keyword:
TOOL ALLOCATION PROBLEM
PART SELECTION
SCHEDULING PROBLEMS
OPTIMIZATION
MODEL
FMS
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
