Modrak Algorithm to Minimize Completion Time for n-Jobs m-Machines Problem in Flexible Manufacturing System
Dr.M.Nageswara Rao
Abstract
Flexible manufacturing systems (FMS) n -Jobs and m -Machines problem has been attempted in this paper using the Vladimr Modrk 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 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.
Topics & Concepts
Computer scienceMathematical optimizationAlgorithmIndustrial engineeringManufacturing engineeringEngineeringMathematicsScheduling and Optimization AlgorithmsAdvanced Manufacturing and Logistics OptimizationDigital Transformation in Industry