检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:陈文洲 CHEN Wenzhou(School of Economics and Management,Fuzhou University,Fuzhou 350108,China)
出 处:《现代制造工程》2022年第1期10-18,共9页Modern Manufacturing Engineering
摘 要:针对考虑工件加工时间不确定性的模糊分布式柔性作业车间调度问题(fuzzy Distributed Flexible Job Shop Scheduling Problem,fDFJSP),将加工时间用三角模糊数表示,以最小化最大模糊完工时间为优化目标,提出一种改进的人工蜂群算法进行求解。针对fDFJSP的分布式特点,设计了基于车间-工序-机器的三层编码方式,针对不同编码层,采用多种混合搜索策略,以提升算法的邻域和全局搜索能力。为测试算法的性能,设计了2组实验对5个算例进行测试,并与代表性算法进行对比。结果表明,所提算法结果总体优于其他对比算法,能够有效求解具有模糊加工时间的模糊分布式柔性作业车间调度问题。Aiming at the fuzzy Distributed Flexible Job Shop Scheduling Problem(fDFJSP)considering the uncertainty of job processing time,the processing time was represented by triangular fuzzy number,and the optimization objective was to minimize the maximum fuzzy completion time.An improved artificial bee colony algorithm was proposed.In view of the distributed characteristics of fDFJSP,a three-layer coding method based on workshop,process and machine was designed.For different coding layers,variety of mixed search strategies were adopted to improve the neighborhood and global search ability of the algorithm.In order to test the performance of the algorithm,two groups of experiments including 5 cases were designed for testing,and compared with the representative algorithm.The results show that the proposed algorithm is better than other algorithms in general,and can effectively solve the optimization of distributed flexible job shop scheduling problem with fuzzy processing time.
关 键 词:模糊加工时间 分布式环境 柔性作业车间 人工蜂群算法
分 类 号:TP301[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.147.79.7