CAJ | 학술논문

针对最小化最大完成时间的有限缓冲区流水线调度问题（LBPFSP），提出一种混合蝙蝠算法（HBA）。在算法设计中，采用基于 SPV 的编码规则以实现连续的实数向离散的作业序列的转变，在种群初始化时引入 NEH 启发式算法，为提高算法的搜索效率，以一定的概率执行基于 Pairwise 的邻域搜索。对标准测试问题在不同缓冲区下的最优值进行仿真并与其他算法进行对比，并对基于 Pairwise 的邻域搜索的执行概率值对算法性能的影响进行讨论，其结果验证了 HBA 求解 LBPFSP 的有效性。
침대최소화최대완성시간적유한완충구류수선조도문제（LBPFSP），제출일충혼합편복산법（HBA）。재산법설계중，채용기우 SPV 적편마규칙이실현련속적실수향리산적작업서렬적전변，재충군초시화시인입 NEH 계발식산법，위제고산법적수색효솔，이일정적개솔집행기우 Pairwise 적린역수색。대표준측시문제재불동완충구하적최우치진행방진병여기타산법진행대비，병대기우 Pairwise 적린역수색적집행개솔치대산법성능적영향진행토론，기결과험증료 HBA 구해 LBPFSP 적유효성。
This paper proposes an effective hybrid bat algorithm (HBA)to solve the problem of permutation flow-shop scheduling with limited buffers (LBPFSP)which minimises the makespan.In algorithm design,we use the smallest position value-based coding rule to convert consecutive real number to discrete job sequences,and introduce NEH heuristic algorithm when the population is initialising.In order to improve the search efficiency of the algorithm,the neighbourhood search based on Pairwise is performed at a certain probability.In addition,we simulate the optimal values of standard test problem in different buffer sizes and compare them with other algorithms,and discuss the effects of the performing probability value of Pairwise-based neighbourhood search on algorithm ’s performance.Simulation and comparisons results have verified the effectiveness of solving LBPFSP with HBA.