Project scheduling optimization of random graph MDP considering active/passive resource constraints

In order to improve the reasonability of project scheduling optimization process, a new project scheduling optimization method for conflict solving is introduced. Once there is conflict in the scheduling scheme, it will not redefine the start time of the project, but to transfer the conflicting time scheduling time table state to get another feasible scheduling time table so as to realize the improvement of algorithm calculation efficiency. 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 solution method based on random graph is designed. Experimental results show the effectiveness of the proposed method in convergence accuracy and calculation efficiency, and demonstrate the rationality of the scheduling scheme by Gantt diagram. (C) 2018 Elsevier Ltd. All rights reserved.