Abstract

AbstractThis article deals with machines, automated guided vehicles (AGVs) and tools simultaneous scheduling in multimachine flexible manufacturing system (FMS) with the lowest possible number of copies of every tool type without tool delay considering jobs' transport times among machines to minimize makespan (MSN). The tools are kept in a central tool magazine (CTM), which is shared by and serves many machines. Tool transporter (TT) and AGVs shift tools and jobs among machines respectively. This concurrent scheduling problem is extremely complex in nature as it involves determining the lowest possible tool copies of every type of tool, allocation of AGVs and tools copies to job‐operations, job‐operations sequencing on machines, and associated trip operations including the dead heading trip and loaded trip times of AGVs. This paper proposes nonlinear mixed integer programming (MIP) formulation to model this problem and symbiotic organisms search algorithm (SOSA) for solving this problem. Verification is carried out using an industrial problem in a manufacturing firm. The results show that employing two copies for one tool type and one copy each for the remaining tool types results in no tool delay and reduction in MSN which causes a reduction in cost, and SOSA is providing better solution than Jaya algorithm.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call