计算机应用研究2018，Vol.35Issue(1)：150-154,165,6.DOI:10.3969/j.issn.1001-3695.2018.01.031
变邻域杂草算法在多目标柔性作业车间调度中的应用
Multi-objective flexible Job-Shop scheduling based on variable neighborhood search invasive weed optimization
摘要
Abstract
This paper applied a variable neighborhood search invasive weed optimization to minimize maximum makespan,total machine workload and maximum machine workload of the flexible Job-Shop scheduling problem(FJSP).Based on random key method,the single chain denoted a scheduling plan.To make a good use of the elite,this paper used a variable neighborhood search operator.And then the weed group obtained the decoded solution.Compared with other algorithms,the improved algorithm has a good performance in quantity and quality.Therefore,the variable neighborhood search invasive weed optimization proves to be an effective method to solve multi-objective FJSP.关键词
杂草算法/柔性作业车间/多目标优化/变邻域搜索Key words
invasive weed optimization/flexible Job-Shop/multi-objective optimizing/variable neighborhood search分类
信息技术与安全科学引用本文复制引用
曹磊,叶春明,黄霞..变邻域杂草算法在多目标柔性作业车间调度中的应用[J].计算机应用研究,2018,35(1):150-154,165,6.基金项目
国家自然科学基金资助项目(71271138) （71271138）
上海市一流学科资助项目(S1201YLXK) （S1201YLXK）
沪江基金资助项目(A14006) （A14006）
上海理工大学人文社科攀登计划资助项目(14XPB01) （14XPB01）
