TY - JOUR

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

AU - Chen, Miawjane

AU - Yan, Shangyao

AU - Wang, Sin Siang

AU - Liu, Chiu Lan

N1 - Publisher Copyright:
© 2014 Taylor and Francis.

PY - 2015/2/1

Y1 - 2015/2/1

N2 - 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.

AB - 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.

KW - MRCPSPDCF

KW - network flows

KW - payment at activity completion times

KW - project scheduling

KW - time-precedence network

UR - http://www.scopus.com/inward/record.url?scp=84926142990&partnerID=8YFLogxK

U2 - 10.1080/0305215X.2013.875167

DO - 10.1080/0305215X.2013.875167

M3 - 期刊論文

AN - SCOPUS:84926142990

VL - 47

SP - 165

EP - 183

JO - Engineering Optimization

JF - Engineering Optimization

SN - 0305-215X

IS - 2

ER -