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. © 2012 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Gao, K. Z., Suganthan, P. N., & Chua, T. J. (2012). Discrete harmony search algorithm for dynamic FJSSP in remanufacturing engineering. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7677 LNCS, pp. 9–16). https://doi.org/10.1007/978-3-642-35380-2_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
