Makespan Minimization in a Multi-Machine FMS with Tooling Constraints Considering Job and Tool Transfer Times Using Crow Search Algorithm

This paper addresses concurrent scheduling of machines, automated guided vehicles (AGVs), tools, and the tool transporter (TT) in a multi-machine flexible manufacturing system (FMS), considering tool and job transport times to minimize makespan (MKSN). However, due to financial constraints, only one copy of each tool type is offered. These tools are placed in a central tool magazine (CTM), which is shared with numerous machines. The problem is the allocation of machines, tool assignment, job-operation sequencing, and trip operations, including TT and AGVs’ empty and laden trip times for MKSN minimization. This study introduces a mixed nonlinear integer programming model to model the problem, and a crow search algorithm (CSA) based on the clever behavior of crows is used to solve it. Results are tabulated, examined, and compared to current algorithms.