计算机工程与应用Issue(2)：262-265,4.DOI:10.3778/j.issn.1002-8331.1412-0353
新型离散蝙蝠算法求解柔性流水车间调度问题
Novel discrete bat algorithm for solving flexible flow shop scheduling problem
摘要
Abstract
A novel discrete bat algorithm is proposed for solving the Flexible Flow Shop Scheduling Problem(FFSP) with makespan criterion. It redefines the addition operation of the speed and position to achieve the displacement of the particles and gives the specific implementation. The experimental results show that the algorithm has good performance in solving the flexible flow shop scheduling problem, and it is an effective scheduling algorithm.关键词
柔性流水车间调度/离散蝙蝠算法/优化算法Key words
Flexible Flow Shop Scheduling Problem(FFSP)/discrete bat algorithm/optimization algorithm分类
信息技术与安全科学引用本文复制引用
徐华,张庭..新型离散蝙蝠算法求解柔性流水车间调度问题[J].计算机工程与应用,2016,(2):262-265,4.基金项目
国家留学基金委赞助项目（No.201308320030）；江苏省自然科学基金（No.BK20140165）。 （）
