《2016 Flexible job shop scheduling using hybrid differential evolution algorithms》.pdf

Computers Industrial Engineering 65 (2013) 246–260 Contents lists available at SciVerse ScienceDirect Computers Industrial Engin eering journal homepage: /locate/caie Flexible job shop scheduling using hybrid differential evolution algorithms q Yuan Yuan, Hua Xu ⇑ 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: This paper proposes hybrid differential evolution (HDE) algorithms for solving the flexible job shop Received 4 May 2012 scheduling problem (FJSP) with the criterion to minimize the makespan. Firstly, a novel conversion mech- Received in revised form 22 September 2012 anism is developed to make the differential evolution (DE) algorithm that works on the continuous Accepted 25 February 2013 domain adaptive to explore the problem space of the discrete FJSP. Secondly, a local search algorithm Available online 14 March 2013 based on the critical path is emb edded in the DE framework to balance the exploration and exploitation by enhancing the local searching ability. In addition, in the local search phase, the speed-up method to Keywords: find an acceptable schedule within