Minimization of machine idle time and penalty cost in flexible manufacturing system scheduling

Abstract

This paper address the application of Jaya algorithm to solve Multi objective scheduling problem in Flexible Manufacturing System(FMS) to Minimize the Combined Objective Function(COF) Value. The effectiveness of this algorithm is tested on the problem of 43 jobs processed on 16 machines taken from literature. The MATLAB code is written to find best sequence and Combined Objective Function value by implementing Jaya Algorithm. Results obtained by Jaya Algorithm are compared with different algorithms such as Genetic Algorithms (GA), Particle Swarm Optimization (PSO), Shortest Processing Time (SPT), Cuckoo Search (CS) and Modified Cuckoos Search (MCS) for the problem considered. It is observed from the results that COF value for the sequence obtained by Jaya Algorithm is better than other algorithms. It is concluded that the Jaya algorithm is best suitable for solving the Scheduling problem considered in Flexible Manufacturing System.