面向多制造任务的工艺路线优化决策方法研究

Study on Optimal Decision-making Method for the Process Routes of Multiple Manufacturing Tasks

针对制造企业中多制造任务的竞争性问题,根据每个制造任务的可行工艺路线集,以制造任务的各自最短完工时间为目标,提出并构建了一种非合作博弈的多任务工艺路线优化决策模型。博弈模型分为工艺路线优化决策阶段和任务调度阶段,前者为后者提供局中人集,后者为前者提供Nash均衡解集,从而实现多制造任务的最优工艺路线的动态决策。采用遗传算法对博弈模型进行具体解算,实例验证了博弈模型的可行性。

According to the competition among multiple manufacturing tasks, concerning the set of flexible process routes of each task, a non-cooperation game model was presented which .was used to decide the optimal process route for each manufacturing task based on the goal of minimizing its own finishing time. This model was divided into two stages： optimal decision-making on process routes and task scheduling. The former stage provided the player set for the latter and the latter provided the former with the set of Nash equilibrium （NE） points where the optimal NE point can be obtained for the former. Adopting this game, the optimal process route for each manufacturing task can be dynamically decided. In order to resolve this game, the genetic algorithm （GA） was utilized. A numerical example is conducted to demonstrate the flexibility of the presented approach.