摘要
针对"研产混线"中各类制造资源利用率低、非加工时间过长、调度难度大的问题,以生产中最紧缺的夹具资源为例,提出考虑装卸的柔性作业车间双资源调度问题.首先,以最小化完工时间和准结时间为目标建立该问题的数学优化模型;然后,设计快速非支配排序遗传算法对问题进行求解,根据问题特性综合考虑两个目标并设计降准解码算法,随机从交叉算子池和变异算子池中选择算子进行操作,根据非支配等级和拥挤度选择进入下一代的个体;最后,通过数值实验表明,针对考虑装卸的柔性作业车间双资源调度问题,所提出算法能够有效求解该问题,保证完工时间的同时降低准结时间.
To solve the problems of low utilization rate of manufacturing resources, long non-processing time and difficult scheduling in a "research and production mixed line"workshop, a flexible job shop dual resource scheduling problem considering fixture loading and unloading is proposed. Firstly, the mathematical optimization model of the problem is established to minimize the makespan and setup time. Then, a non-dominated sorting genetic algorithm is proposed to solve it. The decoding algorithm to reduce setup time is designed to balance the two objectives. The operator is randomly selected from the crossover operator pool and the mutation operator pool, and the next generation is selected according to the non-dominated level and the congestion degree. Finally, the results of numerical experiment show that the proposed algorithm can solve the problem effectively.
作者
吴秀丽
肖晓
赵宁
WU Xiu-li;XIAO Xiao;ZHAO Ning(School of Mechanical Engineering,University of Science and Technology Beijing,Beijing 100083,China)
出处
《控制与决策》
EI
CSCD
北大核心
2020年第10期2475-2485,共11页
Control and Decision
基金
国家自然科学基金项目(51305024)
国防基础科研计划项目(JCKY2018209C002)。
关键词
研产混线
柔性作业车间调度问题
双资源调度
夹具
准结时间
research and production mixed line
flexible job shop scheduling problem
dual resource scheduling
fixture
setup time
