Distributed Factory Disassembly Scheduling Problem

Due to the swift progress in transportation and communication technologies and the globalization strategy layout of enterprises, the various factories of enterprises are being distributed all over the world and are collaborating through Internet networks to share operation information, forming an off-site distributed multi-factory working environment. A distributed factory disassembly scheduling problem is proposed in this paper, which is a comprehensive scheduling problem considering disassembly and allocation. The problem primarily consists of two stages: the disassembly stage and the allocation stage. In the distributed factory disassembly scheduling problem, several factors need to be considered, such as the work efficiency, work time, and equipment utilization of each factory. Therefore, the difficulty of this problem is to optimize a series of problems such as task and workstation allocation within the disassembly factory and to optimize the selection of disassembly and manufacturing factories. In general, the distributed factory has the advantages of higher flexibility, lower risk, a more optimized supply chain, and higher efficiency compared to the traditional single factory. By effectively solving this problem, companies can reduce disassembly costs, improve disassembly efficiency, and optimize resource utilization, which is of great importance to them.