【摘要】 针对批量流水线调度问题,提出了一种改进的人工蜂群算法优化最大完成时间。该算法用NEH方法产生初始解,利用混沌的遍历性生成新的邻域解。为了跳出局部最优,使用最优解插入扰动替换一些连续若干步不能改进的解以提高算法的全局搜索能力,仿真实验结果验证了算法的可行性。更多还原

【Abstract】 Aiming at the scheduling problem of lot-streaming flow shop,an improved artificial bee colony algorithm is proposed to attain the objective of minimizing the maximum completion time.In the proposed algorithm,the NEH heuristic is used to produce an initial solution,and the chaos is employed to generate a new candidate.In order to avoid trapping into local optima,the solution not improved in successively generations will be replaced by the perturbation of the found best solution so far.The simulation results verify the effectiveness of the algorithm.更多还原