摘要
针对车间调度中存在的机器柔性、工人柔性和并行工序柔性,文中用优先级间的加工顺序替代单独工件间的顺序约束来表示并行工序柔性,建立了以最小化最大完成时间、总耗能和平均完成时间为目标的多柔性作业车间调度模型,设计了一种四染色体编码方法及对应的交叉和变异算子,并用两条染色体来编码加工顺序。结合入侵肿瘤生长优化算法的算法结构和NSGAⅢ算法中对解的筛选机制,提出一种多目标优化算法求解模型。该算法使用快速非支配排序方法和基于特征点的选择方法对细胞进行分类和转化,设计替代重复细胞的机制,并基于交叉和变异算子,重新设计了细胞的生长和入侵机制。最后,求解数值实例,用超体积、延展度和分布度对比所提算法和其他多种智能算法得到的解集,结果证明所提算法收敛更快且所得解集分布更均匀。
In view of machine flexibility,worker flexibility and parallel operation flexibility in the job-shop scheduling,this paper denotes the parallel operation flexibility by replacing sequence constraints between individual operations with sequence constraints between priorities,and proposes a multi-flexible job-shop scheduling model with objectives of minimizing the maximum completion time,total energy consumption and average completion time.A four-chromosome coding method and corresponding crossover and mutation operators are designed,in which two chromosomes are used to encode the processing sequence.A multi-objective optimization algorithm is proposed,based on the combination of the structure of the invasive tumor growth optimization and the screening mechanism of NSGAⅢ.The algorithm uses a fast non-dominant sorting method and a feature-based selection method to classify and transform cells.A mechanism is designed to replace duplicate cells.Finally,the proposed algorithm is compared with several intelligent algorithms in calculation examples by hypervolume,distribution and extensibility,which prove its effectiveness and feasibility.
作者
董海
徐晓鹏
谢谢
DONG Hai;XU Xiao-peng;XIE Xie(School of Applied Technology,Shenyang University,Shenyang 110044,China;School of Mechanical Engineering,Shenyang University,Shenyang 110044,China;School of Information Engineering,Shenyang University,Shenyang 110044,China)
出处
《计算机科学》
CSCD
北大核心
2020年第12期239-244,共6页
Computer Science
基金
国家自然科学基金(71672117)。
关键词
作业车间调度问题
工人柔性
并行工序柔性
入侵肿瘤生长优化算法
NSGAⅢ
Job-shop scheduling problem
Worker flexibility
Parallel operation flexibility
Invasive tumor growth optimization algorithm
NSGAⅢ
