Discrete Harmony Search Algorithm for the Disassembly Scheduling Remanufacturing Engineering

Remanufacturing is a growing branch of the traditional manufacturing industry. In this study, a discrete harmony search (DHS) algorithm is proposed for thedisassembly scheduling of products in the remanufacturing engineering.Firstly, the disassembly scheduling of products is regarded as flexible job shop scheduling problem. Then, the harmony search algorithm is discretized for the disassembly scheduling problem.Finally, simulation experiments are carried out to test the proposed discrete harmony search algorithm. The results and comparisons show the effectiveness of the proposed DHS algorithm in solving the disassemblyscheduling problem in remanufacturing engineering.