Hybrid discrete harmony search algorithm for scheduling re-processing problem in remanufacturing

Authors:
Kaizhou Gao;Ponnuthurai Nagaratnam Suganthan;Tay Jin Chua;Tian Xiang Cai;Chin Soon Chong
Affiliations:
Nanyang Technological University, Singapore, Singapore;Nanyang Technological University, Singapore, Singapore;Singapore Institute of Manufacturing Technology, Singapore, Singapore;Singapore Institute of Manufacturing Technology, Singapore, Singapore;Singapore Institute of Manufacturing Technology, Singapore, Singapore
Venue:
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Year:
2013

Citing 5
Cited 0

A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems

Computers and Operations Research
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

This paper proposes a hybrid discrete harmony search algorithm for solving the re-processing scheduling problem in pump remanufacturing. The process of pump remanufacturing and the scheduling problem of re-processing for pump subassembly are modeled. An experience based strategy is proposed for solving the unpredictability of subassembly re-processing time in remanufacturing. Hybrid discrete harmony search algorithm and local search are employed for scheduling re-processing of pump subassembly. The objectives of pump subassembly re-processing scheduling are minimization of the maximum completion time (makespan), and the mean of earliness and tardiness (E/T). These objectives are considered individually as well as together as a multi-objective problem. Computational experiments are carried out using real data from a pump remanufacturing enterprise. Computational results show that the objectives makespan and E/T can be optimized and the resulting schedules can be used in practice.