The Model and Algorithm for Quickly Repairing Strategy of Repetitive Projects under Interference Scenarios
Repetitive projects are usually interfered by uncertainties,and the most important challenge for project managers is how to quickly repair the interfered plan to the baseline scheduling at minimum cost.The reactive scheduling model and algorithm for repeti-tive projects were studied.Firstly,a new model of repairing strategy was proposed to quickly repair the plan to the baseline schedule at a minimum cost.Then a hybrid algorithm combining Q-learning and genetic algorithm was designed to solve the optimization problem.Finally,a highway project and Monte Carlo simulation were used to illustrate the effectiveness of the model and algorithm.Results show that the repairing strategy proposed can reduce reactive scheduling costs,and increasing the extent of repairing can effectively reduce the reactive scheduling costs.Moreover,the proposed hybrid algorithm is superior to the genetic algorithm in terms of solution quality and efficiency for this problem.It can help project managers to deal with reactive scheduling problems of repetitive projects.
construction managementrepetitive projectsreactive schedulinggenetic algorithms
万方数据
维普
