A generalized network flow model for the multi-mode resource-constrained project scheduling problem with discounted cash flows

Abstract

An effective project schedule is essential for enterprises to increase their efficiency of project execution, to maximize profit, and to minimize wastage of resources. Heuristic algorithms have been developed to efficiently solve the complicated multi-mode resource-constrained project scheduling problem with discounted cash flows (MRCPSPDCF) that characterize real problems. However, the solutions obtained in past studies have been approximate and are difficult to evaluate in terms of optimality. In this study, a generalized network flow model, embedded in a time–precedence network, is proposed to formulate the MRCPSPDCF with the payment at activity completion times. Mathematically, the model is formulated as an integer network flow problem with side constraints, which can be efficiently solved for optimality, using existing mathematical programming software. To evaluate the model performance, numerical tests are performed. The test results indicate that the model could be a useful planning tool for project scheduling in the real world.

Keywords:

• network flows
• project scheduling
• MRCPSPDCF
• payment at activity completion times
• time–precedence network

Funding

This research was supported by a grant [NSC-100-2410-H-239-011] from the National Science Council of Taiwan.