期刊文献+

改进的自适应NSGA-Ⅱ求解多目标流水车间调度问题 被引量:1

Solving the Problem of Multi-Objective Flow Shop Scheduling with an Improved Method of Adaptive NSGA-Ⅱ
下载PDF
导出
摘要 针对流水车间生产调度问题,以最大完工时间、总拖期时间和总流程时间最小为目标,构建了多目标优化模型,通过带有自适应参数调节改进的NSGA-Ⅱ算法在生产调度解空间找寻Pareto解集.运用MATLAB对算例进行仿真,获得一组非劣解,将数据进行加权处理可挑选出中意的调度方案.结果表明,NSGA-Ⅱ算法在解决多目标流水车间调度问题上是可行的、有效的,并且为企业提供生产调度排序举措参考. Present situation of multi-objective flow shop scheduling problem is reviewed. Flow shop scheduling problem model is set up which including three criterion of makespan,total tardiness and total flow time. An improved NSGA-Ⅱ Algorithm with adaptive parameter adjustment is proposed to find Pareto set in the production solution space. A set of non-inferior solutions is obtained by means of simulating the example in MATLAB,and then a preferred scheduling scheme can be selected by weighting the data. The results show that the NSGA-Ⅱ algorithm is feasible and effective in solving the scheduling problem of multi-objective flow shop,and meanwhile provide a reference for the production scheduling of enterprises.
作者 张伟 ZHANG Wei(Institute of General Aviation Industry, Fujian Chuanzheng Communications College, Fuzhou Fujian 350007)
出处 《绵阳师范学院学报》 2021年第5期11-17,共7页 Journal of Mianyang Teachers' College
基金 福建省教育厅中青年科研项目(JAT191176).
关键词 自适应参数 NSGA-Ⅱ 多目标优化 流水车间调度 adaptive parameter NSGA-Ⅱ multi-objective optimization flow shop scheduling
  • 相关文献

参考文献6

二级参考文献46

  • 1陈荣军,唐国春.同类机的供应链排序[J].系统工程学报,2010,25(1):62-67. 被引量:14
  • 2崔建双,李铁克,张文新.混合流水车间调度模型及其遗传算法[J].北京科技大学学报,2005,27(5):623-626. 被引量:29
  • 3卫忠,徐晓飞,邓胜春.多目标混合流水车间作业调度的演化算法[J].计算机集成制造系统,2006,12(8):1227-1234. 被引量:19
  • 4蒋义伟,何勇.Semi-Online Algorithms for Scheduling with Machine Cost[J].Journal of Computer Science & Technology,2006,21(6):984-988. 被引量:7
  • 5杨开兵.基于进化计算的多目标流水车间批组调度问题研究[D].大连:大连理工大学,2011.
  • 6PINED M.调度:原理、算法和系统[M].张智海,译.北京:清华大学出版社,2007:1-7.
  • 7GONZALEZ T,SAHNI S.Flow shop and job shop schedules:complexity and approximation[J].Operations Research,1978,26(1):36-52.
  • 8ZIAEIFAR A,TAVAKKOLI-MOGHADDAM R,PICHKA K.Solving a new mathematical model for a hybrid flow shop scheduling problem with a processor assignment by a genetic algorithm[J].International Journal of Advanced Manufacturing Technology,2012,61(1):339-349.
  • 9GAO K,PAN Q,SUGANTHAN PN,et al.Effective heuristics for the no-wait flow shop scheduling problem with total flow time minimization[J].International Journal of Advanced Manufacturing Technology,2013,66(9):1563-1572.
  • 10GAO K,PAN Q,LI J.Discrete harmony search algorithm for the no-wait flow shop scheduling problem with total flow time criterion[J].International Journal of Advanced Manufacturing Technology,2011,56(5):683-692.

共引文献49

同被引文献9

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部