Resource allocation in robust scheduling

Abstract

A robust project scheduling based on resource flow network can prevent new resource contentions from adjustments when encountering the uncertainties during the execution. However, the resource flow network will increase the interdependencies of the activities and lower the robustness of the schedule. For this reason, we propose a heuristic resource allocation algorithm of maximizing the use of precedence relation (MaxPR) to optimize the resource allocation schedule. Our contributions are as follows: first, this paper presents a two-stage algorithm to allocate resources. In Stage 1, the activity pairs with precedence relation can be divided into two categories, zero-lag relation and relation with time-lag. Second, the strategy of unavoidable arcs is adopted to allocate resources to the activity pairs without precedence relation in Stage 2. Third, it is also proved by simulation experiments that MaxPR and its multiple allocation strategies will generate less additional constraints compared with other six algorithms. It can also adapt to various network structures, showing the concision and feasibility of this algorithm.

Keywords:

• Resource allocation
• precedence relation
• resource flow network
• scheduling robustness
• additional constraint

Disclosure statement

No potential conflict of interest was reported by the authors.

Additional information

Funding

This work was supported by the National Natural Science Foundation of China (General Program) under Grant [number 71840004].