基于可变机器约束作业车间调度方法研究  

Research on job-shop scheduling based on variable machine constraints

作　　者：苏世杰[1] 张晓利 叶福民[1] 陈赟 王超 SU Shijie;ZHANG Xiaoli;YE Fumin;CHEN Yun;WANG Chao(School of Mechanical Engineering, Jiangsu University of Science and Technology, Zhenjiang 212003, China)

机构地区：[1]江苏科技大学机械工程学院,镇江212003

出　　处：《江苏科技大学学报（自然科学版）》2020年第2期45-52,共8页Journal of Jiangsu University of Science and Technology:Natural Science Edition

基　　金：国家自然科学基金资助项目(51705214)。

摘　　要：机器固定约束作业车间规定加工某道工序的机器仅有一台,不符合车间实际生产情况.针对其局限性,考虑某工序有多台机器可供选择的可变机器约束,建立综合机器使用成本和延期惩罚费用两方面因素的单目标优化模型,提出改进反转变异法、双交叉以及指数衰减法的遗传退火算法,求解可变机器约束作业车间调度问题(variable machine constraints job-shop scheduling problems,VMCJSSP).仿真发现,与传统遗传算法相比,该算法使生产成本节约45%,最小加工等待时间缩短37%;最后,基于该算法对VMCJSSP、机器固定约束问题进行调度仿真.结果表明,相对于机器固定约束,该算法模拟的生产成本降低58%、最小加工等待时间缩短11%,具有求解大计算量车间调度问题的高效性.There is only one machine required to hand a certain procedure in machine fixed constraint job-shop,which does not meet the actual production situation.In view of its limitations,the choice of variable machine constraints is considered.Firstly,the single objective optimization model,including the cost of machine use-cost and the cost of delayed punishment,is established,and improved GA with inversion method,double cross and exponential decay method is proposed for the VMCJSSP.Simulation results showed that the algorithm,compared with traditional GA,saves the production cost by 45%,and the minimum waiting time is shortened by 37%.Finally,VMCJSSP and fixed machines constrained job-shop scheduling based on Matlab are simulated.The results show that,compared with fixed machine constraints,the production cost simulated by this algorithm is reduced by 58%,the minimum processing waiting time by 11%,and the algorithm has high efficiency for solving large-scale computational job-shop scheduling problems.

关 键 词：VMCJSSP 改进的模拟退火算法 单目标函数 MATLAB仿真 

分 类 号：TP274[自动化与计算机技术—检测技术与自动化装置]