基于博弈论的虚拟制造网络车间调度优化方法  

A Game-theory Based Optimization Approach for Job Scheduling in Virtual Manufacturing Networks

作　　者：聂黎[1] 张国辉[2] 王小刚[1] 白跃伟[1] NIE Li;ZHANG Guohui;WANG Xiaogang;BAI Yuewei(School of Intelligent Manufacturing and Control Engineering,Shanghai Second Polytechnic University,Shanghai,201209;School of Management Science and Engineering,Zhengzhou Institute of Aeronautical Industry Management,Zhengzhou,450015)

机构地区：[1]上海第二工业大学智能制造与控制工程学院,上海201209 [2]郑州航空工业管理学院管理科学与工程学院,郑州450015

出　　处：《中国机械工程》2019年第12期1492-1497,共6页China Mechanical Engineering

基　　金：国家自然科学基金资助项目(U1537110,51605273);科技部重点研发计划-国际合作项目(YS2017YFGH000967);上海第二工业大学学科基金资助项目(XXKZD1603)

摘　　要：针对虚拟制造网络中的车间调度问题,提出了一个非合作博弈调度优化模型,将车间调度问题转化为一场博弈。在分析该博弈调度模型的理想纳什均衡存在性的基础上,提出了D最小纳什均衡的概念。结合虚拟制造网络中车间调度问题的特点,设计了染色体编码与解码方案以及适应度函数,提出了一种基于遗传算法的博弈调度求解算法来求得该博弈调度模型的D最小纳什均衡。在若干基准实例上验证了该方法的有效性。A non-cooperative game model was put forward herein for job scheduling problems in virtual manufacturing networks,which transferred the problems into a game. The concept of D-minimum Nash equilibrium was proposed based on the analysis of the existence of ideal Nash equilibrium in game scheduling model. A Nash equilibrium solving method was proposed based on genetic algorithm in order to search the D-minimum Nash equilibrium of the game. In the genetic algorithm,a chromosome coding and decoding scheme and fitness function were designed according to the characteristics of job scheduling problems in virtual manufacturing networks. Efficiency of the proposed approach was validated on several benchmark instances.

关 键 词：网络联盟 作业调度 博弈论 纳什均衡 遗传算法 

分 类 号：TP181[自动化与计算机技术—控制理论与控制工程]