Discrete harmony search algorithm for dynamic FJSSP in remanufacturing engineering

Authors:
Kaizhou Z. Gao;Ponnuthurai Nagaratnam Suganthan;Tay Jin Chua
Affiliations:
School of EEE, Nanyang Technology University, Singapore, School of Computer, Liaocheng University, Liaocheng, P.R. China;School of EEE, Nanyang Technology University, Singapore;Singapore Institute of Manufacturing Technology, Singapore
Venue:
SEMCCO'12 Proceedings of the Third international conference on Swarm, Evolutionary, and Memetic Computing
Year:
2012

Citing 4
Cited 0

Optimal scheduling of multiple dam system using harmony search algorithm

IWANN'07 Proceedings of the 9th international work conference on Artificial neural networks
Harmony search algorithm for solving Sudoku

KES'07/WIRN'07 Proceedings of the 11th international conference, KES 2007 and XVII Italian workshop on neural networks conference on Knowledge-based intelligent information and engineering systems: Part I
Minimizing the total flow time in a flow shop with blocking by using hybrid harmony search algorithms

Expert Systems with Applications: An International Journal
A local-best harmony search algorithm with dynamic sub-harmony memories for lot-streaming flow shop scheduling problem

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

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.