分布式有限缓冲区流水车间混合EDA调度  

Distributed Limited Buffers Flow Shop Hybrid EDA Scheduling

作　　者：王垒 摆亮[2] 钱斌[1] 胡蓉[1] 祝晓红[1] WANG Lei;BAI Liang;QIAN Bin;HU Rong;ZHU Xiao-hong(Faculty of Information Engineering and Automation,Kunming University of Science and Technology,Kunming 650500,China;National Computer Network Emergency Technical Response Center,Beijing 100029,China)

机构地区：[1]昆明理工大学信息与自动化学院,云南昆明650500 [2]国家计算机网络应急技术处理协调中心,北京100029

出　　处：《控制工程》2020年第4期593-598,共6页Control Engineering of China

基　　金：国家自然科学基金资助项目(51665025,61963022,60904081)。

摘　　要：在实际工业生产背景下,针对具有NP难特性的分布式有限缓冲区流水车间调度问题,提出了一种混合分布估计算法,用于最小化最大完成时间。首先,由于已有算法无法保证局部搜索后概率模型对优质个体分布统计的准确性,提出了反最小完成工厂映射规则;然后,引入基于Swap邻域和基于Insert邻域的局部搜索,进一步加强算法的局部搜索能力,从而对HEDA全局搜索得到的优质解区域进行细致搜索;最后,通过仿真实验和算法的比较验证HEDA的有效性。In the context of actual industrial production,a hybrid distributed estimation algorithm for the distributed limited buffers flow shop scheduling problem with NP-hard characteristics is proposed to minimize the makespan.Firstly,as the existing algorithm cannot guarantee the accuracy of the probability model for the distribution statistics of high-quality individuals after local search.An anti-lowest completion factory map rules was proposed;Then,the local search based on the Swap neighborhood and the Insert neighborhood is introduced.The local search capability of the algorithm is further enhanced to perform a detailed search of the high-quality solution regions obtained by HEDA global search.Finally,the validity of HEDA is verified through simulation experiments and algorithms comparison.

关 键 词：分布式流水线 有限缓冲区 分布估计算法 概率分布模型 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]