A game-theoretic approach to generating optimal process plans of multiple jobs in networked manufacturing
This study seeks to address an approach for generating optimal process plans for multiple jobs in networked manufacturing. Because of production flexibility, generating several feasible process plans for each job is possible. Concerning the networked manufacturing mode, the specific scenario of competitive relationships, like delivery time existing between different jobs, should be taken into account in generating the optimal process plan for each job. As such, in this study, an N-person non-cooperative game-theoretic mathematical solution with complete information is proposed to generate the optimal process plans for multiple jobs. The game is divided into two kinds of sub-games, i.e. process plan decision sub-game and job scheduling sub-game. The former sub-game provides the latter ones with players while the latter ones decide payoff values for the former one to collaboratively arrive at the Nash equilibrium (NE). Endeavouring to solve this game more efficiently and effectively, a two-level nested solution algorithm using a hybrid adaptive genetic algorithm (HAGA) is developed. Finally, numerical examples are carried out to investigate the feasibility of the approach proposed in the study.
process plan networked manufacturing job scheduling hybrid adaptive genetic algorithm game theory