Simultaneous Scheduling of Machines and AGVs in FMS Through Ant Colony Optimization Algorithm
M. Nageswara Rao1, S. Vara Kumari2, P. Manohar3, B. Madesh4, P. Naveen Krishna5, R. Suraj Krishna Sai6
1Dr. M. Nageswara Rao *, Department of Mechanical Engineering, K L E F University, Guntur, AP, India.
2Varakumari S., Department of E C E, K L E F University, Guntur, AP, India.
3P. Manohar, Department of Mechanical Engineering, K L E F University, Guntur, AP, India
4B. Madesh, Department of Mechanical Engineering, K L E F University,Guntur,AP, India.
5P. Naveen Krishna, Department of Mechanical Engineering, K L E F University, Guntur, AP, India.
6R. Suraj Krishna Sai, Department of Mechanical Engineering, K L E F University, Guntur, AP, India.
Manuscript received on February 06, 2020. | Revised Manuscript received on February 10, 2020. | Manuscript published on February 30, 2020. | PP: 1392-1397 | Volume-9 Issue-3, February, 2020. | Retrieval Number: C5410029320/2020©BEIESP | DOI: 10.35940/ijeat.C5410.029320
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 (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: High amount of flexibility and quick response times have become essential features of modern manufacturing systems where customers are demanding a variety of products with reduced product life cycles. Flexible manufacturing system (FMS) is the right choice to achieve these challenging tasks. The performance of FMS is dependent on the selection of scheduling policy of the manufacturing system. In Traditional scheduling problems machines are as considered alone. But material handling equipment’s are also valuable resources in FMS. The scheduling of AGVs is needed to be optimized and harmonized with machine operations. Scheduling in FMS is a well-known NP-hard problem due to considerations of material handling and machine scheduling. Many researchers addressed machine and AGVs individually. In this work an attempt is made to schedule both the machines and AGVs simultaneously. For solving these problems-a new metaheuristic Ant Colony Optimization (ACO) algorithm is proposed.
Keywords: FMS; Operational Completion Time (makespan); Metaheuristic algorithms; AGVs; NP-hard problems.