Mathematical model for deadlock resolution in multiple AGV scheduling and routing network: a case study

Purpose This paper aims to propose and formulate a complicated routing/scheduling problem for multiple automated guided vehicles (AGVs) in a manufacturing system. Design/methodology/approach Considering the due date of AGVs requiring for material handling among shops in a jobshop layout, their earliness and tardiness are significant in satisfying the expected cycle time and from an economic view point. Therefore, the authors propose a mathematical program to minimize the penalized earliness and tardiness for a conflict-free and just-in-time production. Findings The model considers a new concept of turning point for deadlock resolution. As the mathematical program is difficult to solve with a conventional method, an optimization method in two stages, namely, searching the solution space and finding optimal solutions are proposed. The performance of the proposed mathematical model is tested in a numerical example. Practical implications A case study in real industrial environment is conducted. The findings lead the decision-makers to develop a user interface decision support as a simulator to plan the AGVs’ movement through the manufacturing network and help AGVs to prevent deadlock trap or conflicts. The proposed decision support can easily be commercialized. Originality/value The benefits of such commercialization are increase in the quality of material handling, improve the delivery time and prevent delays, decrease the cost of traditional handling, capability of computerized planning and control, intelligent tracking and validation experiments in simulation environment.