关键词: 资源约束, 随机图, 马尔可夫决策过程, 甘特图, 状态转移

Abstract: In order to improve the rationality of the project scheduling optimization process, a new method of scheduling and optimizing the conflict is introduced. Once the conflict occurs in the scheduling scheme, the start time of the project is not redefined. Instead, this paper migrates the time schedules of conflicts to get another feasible schedules, which improves the efficiency of algorithm computation. Then, the active and passive project scheduling problem is formulated as a single comprehensive problem, and the Markov decision process is used to model the above project scheduling optimization problem, and a dynamic programming method based on random graph is designed. The experimental results show the effectiveness of the proposed method in terms of convergence accuracy and computational efficiency, and demonstrate the rationality of the scheduling scheme through Gantt chart.

Key words: resource constraints, random graphs, Markov decision process, Gantt graph, state transfer