期刊
APPLIED SOFT COMPUTING
卷 13, 期 3, 页码 1459-1463出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.asoc.2011.10.024
关键词
Scheduling; Permutation flowshop scheduling; Artificial bee colony algorithm; GRASP; NEH heuristics
To minimize the makespan in permutation flowshop scheduling problems, a hybrid discrete artificial bee colony (HDABC) algorithm is presented. In the HDABC, each solution to the problem is called a food source and represented by a discrete job permutation. First, the initial population with certain quality and diversity is generated from Greedy Randomized Adaptive Search Procedure (GRASP) based on Nawaz-Enscore-Ham (NEH) heuristics. Second, the discrete operators and algorithm, such as insert, swap, path relinking and GRASP are applied to generate new solution for the employed bees, onlookers and scouts. Moreover, local search is applied to the best one. The presented algorithm is tested on scheduling problem benchmarks. Experimental results show its efficiency. (C) 2011 Elsevier B. V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据