.png){kind=icon}
返回
A genetic algorithm approach to the multiple machine tool selection problem
.png){kind=icon}
PRE
AI
DOI：10.1023/A:1011215416734.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A number of earlier researches have emphasized the on-the-job scheduling problems that occur with a single flexible machine. Two solutions to the problem have generally been considered; namely minimization of tool switches and minimization of tool switching instances. Methods used to solve the problems have included KTNS heuristic, dual-based relaxation heuristic, and non-LP-based branch-and-bound methods. However, scant literature has considered the case of job scheduling on multiple parallel machines which invokes another problem involving machine assignment. This paper addresses the problem of job scheduling and machine assignment on a flexible machining workstation (FMW) equipped with multiple parallel machines in a tool-sharing environment. Under these circumstances, the authors have attempted to model the problem with the objective of simultaneously minimizing both the number of tool switches and the number of tool switching instances. Furthermore, a set of realistic constraints has been included in the investigation. A novel genetic algorithm (GA) heuristic has been developed to solve the problem, and performance results show that GA is an appropriate solution.
Keyword:
flexible machining workstation (FMW)
genetic algorithms (GA)
machine assignment problem
job scheduling problem
tool sharing
tool switching
tool switching instances
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
