关键词: 鲁棒性, 资源流网络, 活动拖期, 拖期惩罚成本

Abstract:

Aimed at the fact that project schedules have to be re-scheduled owing to tardiness in activities, robust baseline schedules are generated based on optimization of the resource flow network from resource allocation. First, a tardiness penalty cost (TPC) indicator is proposed to measure the schedule robustness, based on which, a dynamic model of resource flow network optimization is developed to minimize the sum of TPC. Next, a minimizing tardiness penalty cost (MTPC) algorithm is developed for solving the model. This algorithm is activity-based, in which resources are efficiently transferred from one activity to the other with a minimal TPC in order to increase the schedule robustness. Finally, Monte Carlo computational experiments are conducted to verify the feasibility and effectiveness of the MTEC algorithm compared with other three algorithms (RRAS, Min-EA and MABO). The computational results indicate that the MTEC algorithm outperforms these three algorithms in schedule robustness, stability of resource allocation, and temporal efficiency of algorithms. Therefore, the MTPC can not only efficiently allocate resources, but also improve the schedule robustness by reducing the tardiness in activities, which helps project managers to develop more stable baseline schedules against disruptions.

Key words: robust, resource flow network, tardiness in activities, tardiness penalty cost