Resource flow network generation algorithm in robust project scheduling

Abstract

The research of project scheduling based on resource flow network provides a new approach for studying project scheduling. And the stability of resource flow network also directly affects the performance of robust scheduling. In order to reasonably allocate resources to prevent from resource conflict, we propose a heuristic algorithm RFAP(Resource allocation based on Forward Activity Priority) in this article, trying to generate as table resource flow network. The main contributions of this article are as follows: (1) Using tabu search algorithm to form a baseline scheduling, and then adding unavoidable arcs to develop the expanded precedence relations between activities; (2) Sorting the activities that receive resources based on specific rules; (3) Establishing priority rules for forward activities that can provide resources, and adding additional constraints between activity pairs that are less risky. At last, the experiments verity the RFAP can reduce additional constraints and the stability cost.

Keywords:

• Project scheduling
• robust scheduling
• robustness
• resource flow network

Disclosure statement

No potential conflict of interest was reported by the author(s).