Study on Genetic Algorithms Approach Applied to the Capacitated Disassembly Scheduling Problem

This paper analyzes the capacitated disassembly scheduling problem, in which the limitations of multiple resources, overtime considerations and corresponding resources required for setup are taken into account explicitly. A genetic algorithm is proposed by making use of the problem-specific knowledge in which only the binary variables for the setup patterns of root items are encoded and a two-stage procedure is presented as the decoding scheme. Results of computational experiments on randomly generated test problems indicate that the heuristic genetic algorithm gives the optimal solutions to all test problems in a very short amount of computation time.