Robust scheduling optimization for resource-constrained project based on random duration of activities

The robustness of project schedule plays an important role for the smooth execution of project under uncertain conditions.The authors studied the resource-constrained project robust scheduling problem with random duration of activities.The objective was to arrange the start time of activities so as to maximize the robustness of project schedule under the constraints of renewable resources and project duration.The studied problem was identified and illustrated by using an example at first.Then the optimization model was constructed and three heuristic algorithms,including tabu search,multiple iteration, and random generation,were developed.Ultimately,the algorithms were tested on a standard instance set generated randomly.The influences of activity number,project duration,and resource strength on the algorithms' performance were analyzed.An instance was utilized to illustrate the research in the paper and the following conclusions were drawn:The solution quality of the tabu search is remarkably higher than that of the other two algorithms;as the resource strength or the project duration increase,the average value of objective function climbs and the quality advantage of the desirable solution of the tabu search augments.The research in this paper can provide decision supports for the preparation of project schedule under uncertain conditions.