计算机技术与发展2019，Vol.29Issue(3)：144-148,153,6.DOI:10.3969/j.issn.1673-629X.2019.03.030
人工蜂群算法求解混合约束流水车间调度问题
Artificial Bee Colony Algorithm for Flow Shop Scheduling Problem with Mixed Buffering Requirements
摘要
Abstract
The flow shop scheduling is a classical combinatorial optimization problem, but the traditional flow shop scheduling is difficult to be applied to some complex practical problems because it ignores the buffer constraints between different processes. Therefore, we propose a new flow shop scheduling problem with different stage buffering requirements, and put forward the discrete artificial bee colony (DABC) to resolve it. In DABC, the permutation based encoding schemes is designed, PF_NEH algorithm is used to construct the initial populations to improve the quality of populations. In employed bee phase, on the basis of iterative greedy algorithm, the iterated greedy algorithm with destruction operation of sections is proposed to generate the neighborhood individual. In onlooker bee phase, the better and worse solutions are selected together, and Path-relinking algorithm is proposed to make further search. In scout bee phase, in addition to eliminating worse individuals, perturbation strategy is designed to jump out of the local best. Effectiveness of the proposed algorithm is validated through a group of benchmark instances.关键词
离散人工蜂群算法/流水车间调度/最小化最大完工时间/混合约束Key words
discrete artificial bee algorithm/flow shop scheduling/makespan/mixed buffering requirements分类
信息技术与安全科学引用本文复制引用
孙厚权,张其亮..人工蜂群算法求解混合约束流水车间调度问题[J].计算机技术与发展,2019,29(3):144-148,153,6.基金项目
国家自然科学基金(11401262) （11401262）
