A game theory approach for multiple design tasks schedule

This paper presents a new kind of scheduling solution for multiple design tasks in networked developing environments. The main contributions of this study can be focused on three points: The first is to distinguish the concepts and contents of the task scheduling in the networked developing environments. The second is to construct a game-theory mathematical model to deal with this new multiple design tasks scheduling problem. In the presented mathematical model, the players, strategies and payoff are given separately. Therefore, obtaining the optimal scheduling results is determined by the Nash equilibrium (NE) point of this game. In order to find the NE point, a genetic algorithm (GA)-based solution algorithm to solve this mathematical model is proposed. Finally, a numerical case study is presented to demonstrate the feasibility of the methods.