Modrak Algorithm to Minimize Completion Time for n-Jobs m-Machines Problem in Flexible Manufacturing System

Dr.M.Nageswara Rao
2020 International Journal of Emerging Trends in Engineering Research  
Flexible manufacturing systems (FMS) n -Jobs and m -Machines problem has been attempted in this paper using the Vladimír Modrák Algorithm. Job operations in FMS performed by more than one machine, In FMS Np hard problems are considered computationally. Automated Guided Vehicles (AGVs) are used to transfer the material between machines which are not allowed to return after each delivery from load/unload station. Its objective is to minimize the completion time. Current demand demarcated by needs
more » ... demarcated by needs of the market survive market industries to essential flexibility and ability by FMS. An FMS includes four or more workstations which are connected by electronically controlled material handling and distributed controlled system.
doi:10.30534/ijeter/2020/84882020 fatcat:gpag3kgqr5csbgqj4q7v2aljia