Preemptive Multi-mode Resource-Constrained Discrete Time-Cost-Resource Optimization via Non-dominated Sorting Genetic Algorithm

被引:2
|
作者
Ma, Wei-min [1 ]
Che, Yang-yang [1 ]
Ke, Hua [1 ]
机构
[1] Tongji Univ, Sch Econ & Management, Shanghai 200092, Peoples R China
关键词
Discrete time-cost trade-off; Genetic algorithm; Preemption; Resource leveling; Resource-constrained project scheduling; PROJECT SCHEDULING PROBLEMS; TRADE-OFF PROBLEM;
D O I
10.2991/978-94-6239-145-1_68
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
With the current intense competitive circumstance, preemption is taken into consideration in project scheduling gradually, and multi-objective is providing new insights. For the purpose of practical relevance, a preemptive multi -mode resource-constrained discrete time-cost-resource optimization model (P-MRCDTCRO) is presented in this paper. The integrated model provides interruption extension of the MRC-DTCRO model, which allows activity splitting. Accordingly, a modified non-dominated sorting genetic algorithm (NSGA-II) with preemption validity is proposed. A set of non -dominated schedules involving combinatorial optimization of completion time, cost and resource leveling is determined. This paper based on a valid algorithm provides new perspectives in both preemption and multi-objective problem, which is also propitious to decision-making in project construction.
引用
收藏
页码:719 / 728
页数:10
相关论文
共 50 条