arrow
返回

Genetic algorithm parameter optimisation using Taguchi method for a flexible manufacturing system scheduling problem

delete2014-07-23
delete52
PRE
AI
G
Gökçe Candan *
H
Harun Reşit Yazg̈an
DOI:10.1080/00207543.2014.939244delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
The flexible manufacturing system (FMS) scheduling problem is one of the most difficult NP-hard combinatorial optimisation problems. The exact solution of an FMS scheduling problem cannot be found within a reasonable amount of time, even for small size problems. Therefore, a metaheuristic algorithm is required to solve such a problem. The objective of this study is to develop a genetic algorithm (GA) approach to minimise makespan of the scheduling problem. A Taguchi orthogonal array is proposed instead of a full factorial experimental design for determining the parameters of the GA. The effects of the GA parameters on the minimum makespan values are determined and an analysis of variance is performed to investigate significance factors on the results.
Keyword:
Taguchi orthogonal arrays method
flexible manufacturing system scheduling
genetic algorithm
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

International Journal of Production Research 封面图
International Journal of Production Research
IF:
7.3
论文数:
1.1W
被引数:
3.7W

机构

S
Sakarya University
学者数:
3.9K
论文数: 3.4K
被引数: 2.8K
引用论文

引用论文

err分享
err收藏
A genetic algorithm for the Flexible Job-shop Scheduling Problem
err2008-10-01
err759
PREAI
errPezzella, F.; Morganti, G.; Ciaschetti, G.
err分享
err收藏
学者 查看更多内容