Multi objective scheduling optimization in flexible manufacturing system by jaya algorithm

ISSN: 22498958
Citations of this article
Mendeley users who have this article in their library.


In Flexible Manufacturing System Scheduling plays a crucial role, to meet the customer requirements and cope up with frequent fluctuations in demand. Many researchers are attempted the scheduling problem by considering the single objective, and very few researchers have applied GA, CS, PSO algorithms to solve the Multi-objective Scheduling Problems. The FMS considered in this work has Scheduling of 80 verities of products to be manufactured on 16 CNC machine tools by considering multi-objectives as Minimization of Machine Idle time and Minimization of Penalty cost. In this work Jaya Algorithm has been implemented using Mat lab, to solve Multiobjective scheduling problem to minimize the Combined Objective Function Value. The effectiveness of this algorithm is tested on benchmark problems by using different methods like Largest Processing Time (LPT) and Shortest Processing Time (SPT). The problem considered is that 80 jobs have to be manufactured by processing on 16 machines is taken from literature. COF value for the sequence obtained by Jaya Algorithm is better compared with values obtained by other algorithms. It is concluded that the proposed Jaya algorithm is better than many other earlier approaches.




Satish Kumar, B., Raju, G. J., & Janardhana, G. R. (2019). Multi objective scheduling optimization in flexible manufacturing system by jaya algorithm. International Journal of Engineering and Advanced Technology, 8(4), 865–871.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free