Pareto-based discrete harmony search algorithm for flexible job shop scheduling

2012 ◽  
Author(s):  
K.Z. Gao ◽  
P.N. Suganthan ◽  
T.J. Chua
Keyword(s):  
Job Shop ◽  
Job Shop Scheduling ◽  
Search Algorithm ◽  
Harmony Search ◽  
Harmony Search Algorithm ◽  
Flexible Job Shop ◽  
Flexible Job Shop Scheduling ◽  
Shop Scheduling ◽  
Discrete Harmony Search

Discrete Harmony Search Algorithm for the Disassembly Scheduling Remanufacturing Engineering

2012 ◽  
Vol 236-237 ◽  
pp. 169-174
Author(s):  
K.Z. Gao ◽  
P.N. Suganthan ◽  
T.J. Chua
Keyword(s):  
Manufacturing Industry ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Search Algorithm ◽  
Harmony Search ◽  
Harmony Search Algorithm ◽  
Flexible Job Shop Scheduling ◽  
Simulation Experiments ◽  
Traditional Manufacturing ◽  
Discrete Harmony Search

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.

Sign in / Sign up

Export Citation Format

Share Document