Dynamic decision model approach for project planning under commitments

Many companies carry out various projects for the contracts they. Companies make some commitments with these contracts. If these commitments are not fulfilled, penalties occur. In order to fulfill the conditions required by the contract, projects must be dynamically planned and managed with limited time, budget and resources. Time commitment has been considered within the scope of the study and Markov decision process model and heuristic approach are proposed. The minimum and maximum workloads of the activities are determined close to reality by utilizing the knowledge of the employees in the project. The longest time is calculated by the critical path method. The model optimizes the average longest time for the project by using minimization function and finds the average best time. It becomes difficult to plan dynamically. The progress of the activities and their planned durations were compared with a certain algorithm and a decision rule was developed in which the action to be taken was decided. By using the decision rule, the model is differentiated and a heuristic model is created. Due to the time commitment, the time promised in the contract at the beginning of the project was taken into account. The created models were solved for different project networks. By comparing the results of the Markov decision model and the heuristic model, the constraint values and parameters in the models can be updated. In order to reduce the processing load, it has been proposed to divide the projects into work packages.