Scheduling analysis of flexible job shop system by improved gravitational search algorithm

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.   Key words: Gravitational search algorithm, flexible job shop scheduling production.