Abstract

Remanufacturing is a growing branch of the traditional manufacturing industry. In this study, a discrete harmony search (DHS) algorithm is proposed for the dynamic flexible job shop scheduling problem (FJSSP) in remanufacturing. Firstly, the dynamic flexible job shop scheduling in remanufacturing engineering is described. Secondly, the harmony search algorithm is discretized for the dynamic flexible job shop scheduling problem. Thirdly, a new method for improving a new harmony is proposed based on the characteristics of dynamic FJSSP and solution representation. Finally, simulation experiments are carried out to test the proposed discrete harmony search algorithm. The results show the effectiveness of the proposed DHS algorithm in solving the disassembly scheduling problem in remanufacturing engineering.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.