期刊
COMPUTERS & INDUSTRIAL ENGINEERING
卷 65, 期 2, 页码 246-260出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2013.02.022
关键词
Scheduling; Flexible job shop; Differential evolution; Local search; Neighborhood structure; Makespan
资金
- National Natural Science Foundation of China [61175110]
- National S&T Major Projects of China [2011ZX02101-004]
- National Basic Research Program of China (973 Program) [2012CB316300]
This paper proposes hybrid differential evolution (HDE) algorithms for solving the flexible job shop scheduling problem (FJSP) with the criterion to minimize the makespan. Firstly, a novel conversion mechanism is developed to make the differential evolution (DE) algorithm that works on the continuous domain adaptive to explore the problem space of the discrete FJSP. Secondly, a local search algorithm based on the critical path is embedded 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 find an acceptable schedule within the neighborhood structure is presented to improve the efficiency of whole algorithms. Extensive computational results and comparisons show that the proposed algorithms are very competitive with the state of the art, some new best known solutions for well known benchmark instances have even been found. (c) 2013 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据