考虑加工时间和交货期模糊的批调度问题研究  

Research on Batch Scheduling Problem Considering Fuzzy Processing Time and Fuzzy Due Date

作　　者：王雷雷 赵永中 司佳佳 李小林[1] WANG Lei-lei;ZHAO Yong-zhong;SI Jia-jia;LI Xiao-lin(School of Mines,China University of Mining and Technology,Jiangsu Xuzhou 221116,China)

机构地区：[1]中国矿业大学矿业工程学院,江苏徐州221116

出　　处：《机械设计与制造》2022年第5期292-297,共6页Machinery Design & Manufacture

基　　金：国家自然基金青年基金(71401164);中国矿业大学青年科技基金(2014QNA48)。

摘　　要：针对实际生产中存在的时间参数不确定性问题,对单机环境下同时考虑模糊加工时间和模糊交货期的成批调度问题进行研究。分别用三角模糊数和梯形模糊数表示模糊加工时间与交货期,分析了最小化总延迟的情况下工件的模糊交货期和模糊加工时间的隶属度函数与决策者对该工件的完工时间满意度的函数关系,以满意度为优化目标,建立模糊数学优化模型。设计BFEDD(Best Fit Earliest Due Date)启发式算法,以及改进的殖民地同化策略(殖民地移动),建立改进的帝国主义竞争算法(IICA,Improved Imperialist Competitive Algorithm)对所研究问题进行求解,最后设计仿真实验验证了算法的有效性。Considering the uncertainty of time parameters in real production,the problem of single-batch processing machine scheduling problem is stuided in this paper based on fuzzy processing time and fuzzy due date.Job processing time and due date are represented by triangular fuzzy number and trapezoidal fuzzy number,respectively,the functional relationship between membership function of fuzzy variables and degree of satisfaction of decision maker on job completion time are discussed in detail considereing maximum lateness minimization,the fuzzy optimization mathematical model is presentd to minimizine the degree of unsatisfaction.The improved imperialist competitive algorithm(IICA)is designed to solve the problem under study based on the heuristic algorithm BFEDD(Best Fit Earliest Due Date)and the improved assimilation policy(ie,colony movement).Simulation experiments are conducted to verify the effectiveness of the algorithm processed.

关 键 词：批调度 单机环境 模糊加工时间 模糊交货期 帝国主义竞争算法 

分 类 号：TH16[机械工程—机械制造及自动化] F406[经济管理—产业经济]