【摘要】 传统的任务调度主要定位在单个制造车间或单元层面,难以满足网络化制造环境下的客户竞争和加工设备的跨车间甚至企业的分布式特性的调度需求。针对该问题,采用博弈论理论,构建一种网络化制造环境下任务调度的非合作博弈模型,将对任务调度的优化求解转化为对寻求非合作博弈模型的Nash均衡解。同时,采用遗传算法实现了对非合作博弈模型模型的具体解算,系统的运行实例表明了该任务调度模型和实现方法的可行性。更多还原

【Abstract】 The traditional job scheduling mainly focuses on the level of single workshop or manufacturing cell,which cannot satisfactorily meet the requirements of customer’s competition and distributive characteristics of the facilities in the networked manufacturing environment.To deal with this problem, a novel non-cooperative job scheduling game model was proposed and constructed based on the game theory.According to this game model,the optimal scheduling results principally relied on seeking for the Nash equilibrium(NE) point of this game.Meanwhile,in order to find out the NE point,a genetic algorithm(GA) was introduced as the solution procedure.Finally,a numerical experiment was performed to demonstrate the feasibility of this job scheduling game model and its implementing methods.更多还原