Discrete Harmony Search Algorithm for Dynamic FJSSP in Remanufacturing Engineering

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.

[1]  Alberto Prieto,et al.  Computational and ambient intelligence , 2009, Neurocomputing.

[2]  Jing J. Liang,et al.  A local-best harmony search algorithm with dynamic sub-harmony memories for lot-streaming flow shop scheduling problem , 2011, Expert Syst. Appl..

[3]  Z. Geem.  Optimal Design of Water Distribution Networks Using Harmony Search , 2009 .

[4]  Ruud H. Teunter,et al.  Dynamic lot sizing with product returns and remanufacturing , 2006 .

[5]  Zong Woo Geem,et al.  Novel derivative of harmony search algorithm for discrete design variables , 2008, Appl. Math. Comput..

[6]  M. Fesanghary,et al.  Optimization of multi-pass face-milling via harmony search algorithm , 2009 .

[7]  Rajesh Kumar,et al.  An Improved Harmony Search algorithm for optimal scheduling of the diesel generators in oil rig platforms , 2011 .

[8]  Gilvan C. Souza,et al.  Multiperiod Remanufacturing Planning With Uncertain Quality of Inputs , 2010, IEEE Transactions on Engineering Management.

[9]  Robert W. Grubbström,et al.  Optimal production opportunities in a remanufacturing system , 2006 .

[10]  Lakhmi C. Jain,et al.  Knowledge-Based Intelligent Information and Engineering Systems , 2004, Lecture Notes in Computer Science.

[11]  Quan-Ke Pan,et al.  Discrete harmony search algorithm for the no-wait flow shop scheduling problem with total flow time criterion , 2011 .

[12]  Zong Woo Geem,et al.  A New Heuristic Optimization Algorithm: Harmony Search , 2001, Simul..

[13]  Zong Woo Geem,et al.  Harmony Search Algorithm for Solving Sudoku , 2007, KES.

[14]  Mehmet Fatih Tasgetiren,et al.  Minimizing the total flow time in a flow shop with blocking by using hybrid harmony search algorithms , 2010, Expert Syst. Appl..

[15]  Jing J. Liang,et al.  A Hybrid Harmony Search Algorithm for the no-Wait Flow-shop Scheduling Problems , 2012, Asia Pac. J. Oper. Res..

[16]  M. Fesanghary,et al.  An improved harmony search algorithm for solving optimization problems , 2007, Appl. Math. Comput..

[17]  K. Lee,et al.  The harmony search heuristic algorithm for discrete structural optimization , 2005 .

[18]  L. Coelho,et al.  An improved harmony search algorithm for synchronization of discrete-time chaotic systems , 2009 .

[19]  M. S. Spencer,et al.  An evaluation of capacity planning techniques in a remanufacturing environment , 1997 .

[20]  Zong Woo Geem,et al.  Optimal Scheduling of Multiple Dam System Using Harmony Search Algorithm , 2007, IWANN.

[21]  John S. Usher,et al.  Production planning for remanufactured products , 2007 .

[22]  Rajesh Srivastava,et al.  Product structure complexity and scheduling of operations in recoverable manufacturing , 1997 .

[23]  Zong Woo Geem,et al.  Application of Harmony Search to Vehicle Routing , 2005 .