研究了以提前/拖后惩罚指标为目标的批量流水线调度问题,给出了该问题的数学模型以及小批量的调整策略。根据蛙跳算法的原理,采用基于工序的编码方式并利用两点交叉操作设计了新的位置生成公式,提出了解决该问题的离散蛙跳算法。为进一步增强算法的开发能力和效率,结合扰动策略、模拟退火概率接受准则和插入邻域搜索对该算法进行改进。对随机生成的实例进行了广泛的试验,结果表明了所提算法的高效性。
The lot-streaming flow shop scheduling problem to minimize the total Earliness /Tardiness(E/T)penalty was studied.According to the principle of frog-leaping algorithm,a novel allocation function was designed by adopting sequence-based coding method and two-point crossover operator.Then,a novel discrete Shuffled Frog-Leaping Algorithm(SFLA)was put forward to solve the problem.To further enhance development capability and efficiency of the algorithm,the proposed SFLA was improved with perturbation tactic,simulated annealing acceptance criteria and inserting neighborhood search.Extensive experiments based on the randomly generated instances were conducted.Computational results and comparison verified the effectiveness of the proposed algorithm.