A multi-mode resource-constrained discrete time–cost tradeoff problem and its genetic algorithm based solution

详细信息    查看全文

• 作者：Peng Wuliang ; Wang Chengen
• 关键词：Project management ; Discrete time– ; cost tradeoff ; Planning and scheduling ; Genetic algorithm
• 刊名：International Journal of Project Management
• 出版年：2009
• 出版时间：August 2009
• 年：2009
• 卷：27
• 期：6
• 页码：600-609
• 全文大小：467 K

文摘

The discrete time–cost tradeoff problem (DTCTP) is an important subject in the project scheduling theory and applications. Due to the fact that the resources used in projects in modern enterprises mainly belong to renewable resources, e.g. manpower resources, the general DTCTP is extended to a new multi-mode resource-constrained DTCTP model (MRC-DTCTP). The multi-mode resource-constrained project scheduling problem (MRCPSP) was referred and the renewable resource constraints were added to the general DTCTP. By predefining the resource price, the renewable resources are related to the project costs, including direct cost and indirect cost. Every activity can be executed in the crashing way in which the project direct costs are used to shorten the activity duration. According to the characteristics of the MRC-DTCTP, an improved genetic algorithm for solving it was developed and its effectiveness was verified by compared with the exact algorithm. Finally an entire time–cost tradeoff curve for a project network was drawn through computing project deadline problem, and the advantages of the MRC-DTCTP were investigated based on computation results.