文章基本信息

标题：Scheduling analysis of flexible job shop system by improved gravitational search algorithm
本地全文：下载
作者：Behnam Barzegar ; Homayun Motameni ; Motahareh Zarinpour 等
期刊名称：African Journal of Business Management
印刷版ISSN：1993-8233
出版年度：2012
卷号：6
期号：23
页码：7005-7015
DOI：10.5897/AJBM11.2989
语种：English
出版社：Academic Journals
摘要：The flexible job shop problem is an extension of the classical job shop scheduling problem which allows an operation to be performed by one machine out of machines. The problem is to assign each operation to a machine and to order the operation on the machines, such that the maximal completion time of all operations is minimized, which is denoted by Makespan. The flexible job shop scheduling problem is known in the literatue as one of the hardest combinatorial optimization problems. Different methods and algorithms have been presented for solving this problem. Having a reasonable scheduled production system has significant influence on improving effectiveness and attaining to organization goals. In this paper, new algorithms were proposed for flexible job shop scheduling production systems that is based on gravitational search algorithm. The offered algorithm is named FJSP-GSA and so as to confirm it, the algorithm should be implemented and compared with other algorithms. The experimental results showed that the proposed algorithm has reasonable performance in comparison with other algorithms.
关键词：Gravitational search algorithm; flexible job shop scheduling production