Title: Development of scheduling methodology in a multi-machine flexible manufacturing system without tool delay employing flower pollination algorithm

Abstract

This paper addresses machines, automated guided vehicles (AGVs), tool transporter (TT), and tools concurrent scheduling in a multi-machine flexible manufacturing system (FMS) for makespan minimization. The fewest copies of each tool type are employed to prevent tool delays, and job and tool shift times between machines are taken into account. The tools are placed in a central tool magazine (CTM), which shares and serves them to many machines to cut down the price of duplicating the tools in each machine. This simultaneous scheduling problem is challenging to solve because it entails determining the fewest tool copies of each tool kind without tool delay, assigning AGVs and tool copies to job-operations (jb-ons), ordering jb-ons on machines, and related trip operations such as deadheading and loaded flight times for both TT and AGVs. This paper uses a mixed-integer nonlinear programming (MINLP) framework to present the problem, and a flower pollination algorithm (FPA) is employed to solve it. For verification, a manufacturing company's industrial problem is employed. The results show that employing two copies each for two tool types and one copy each for the remaining tool types causes no tool delay, reduction in makespan and cost, and the FPA outperforms the Jaya algorithm.

Biography

N Sivarami Reddy completed his Ph.D. at JNTUA, India, in 2019. Currently, he is working as a Professor of Mechanical Engineering. He has 30 papers to his credit. His research areas include the Scheduling of FMS and Soft Computing Techniques.