《2016 A hybrid harmony search algorithm for the flexible job shop scheduling problem》.pdf

Applied Soft Computing 13 (2013) 3259–3272 Contents lists available at SciVerse ScienceDirect Applied Soft Computing j o u r na l h o me p ag e: w w w. elsev /locate/aso c A hybrid harmony search algorithm for the flexible job shop scheduling problem Yuan Yuan, Hua Xu ∗ , Jiadong Yang State Key Laboratory of Intelligent Technology and Systems, Tsinghua National Laboratory for Information Science and Technology, Department of Computer Science and Technology, Tsinghua University, Beijing 100084, PR China a r t i c l e i n f o a b s t r a c t Article history: In this paper, a novel hybrid harmony search (HHS) algorithm based on the integrated approach, is Received 1 May 2012 proposed for solving the flexible job shop scheduling problem (FJSP) with the criterion to minimize Received in revised form 5 January 2013 makespan. First of all, to make the harmony search (HS) algorithm adaptive to the FJSP, the converting Accepted 4 February 2013 techniques are developed to convert the continuous harmony vector to a kind of discrete two-vector Available online 5 March 2013 code for the FJSP. Secondly, the harmony vector is mapped into a feasible active schedule through effec- tively decoding the transformed two-vector code, which could largely reduce the search space. Thirdly, Keywords: a resultful initialization scheme combining heuristic and random strategies is introduced to make the Scheduling Flexible job shop