Minimization of Machine Idle Time and Penalty Cost in Flexible Manufacturing System Scheduling
B. Satish Kumar1, G. Janardhana Raju2, G. Ranga Janardhana3

1B. Satish Kumar, Associate Prof, Department of Mechanical Engineering, S R. Engineering College, Warangal, (AP) India.
2G. Janardhana Raju, Dean School of Engineering, Nalla Narsimha Reddy Edu. Society Group of Institutions, Hyderabad, (AP) India.
3G. Ranga Janardhana, Professor, Department of Mechanical Engg. University College of Engineering, JNTU Anantapur, (AP) India.
Manuscript received on July 20, 2019. | Revised Manuscript received on August 10, 2019. | Manuscript published on August 30, 2019. | PP: 483-487 | Volume-8 Issue-6, August 2019. | Retrieval Number: E7877068519/2019©BEIESP | DOI: 10.35940/ijeat.E7877.088619
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (

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.
Keywords: Flexible Manufacturing Systems, Combined Objective Function, Jaya Algorithm.