Journal of Systems Engineering and Electronics ›› 2006, Vol. 17 ›› Issue (1): 96-102.doi: 10.1016/S1004-4132(06)60018-2

• SYSTEMS ENGINEERING • Previous Articles     Next Articles

Heuristic algorithm for RCPSP with the objective of minimizing activities' cost

Liu Zhenyuan & Wang Hongwei   

  1. Inst. of Systems Engineering, Huazhong Univ. of Science and Technology, Wuhan 430074, P. R. China
  • Online:2006-03-24 Published:2019-12-19

Abstract:

Resource-constrained project scheduling problem(RCPSP) is an important problem in research on project management. But there has been little attention paid to the objective of minimizing activities' cost with the resource constraints that is a critical sub-problem in partner selection of construction supply chain management because the capacities of the renewable resources supplied by the partners will effect on the project scheduling. Its mathematic model is presented firstly, and analysis on the characteristic of the problem shows that the objective function is non-regular and the problem is NP-complete following which the basic idea for solution is clarified. Based on a definition of preposing activity cost matrix, a heuristic algorithm is brought forward. Analyses on the complexity of the heuristics and the result of numerical studies show that the heuristic algorithm is feasible and relatively effective.

Key words: systems engineering, resource-constrained project scheduling problem, activities' cost, preposing activity cost matrix, heuristic algorithm