Genetic Algorithm with Critical Path Improvement for Solving Resourceconstrained Project Scheduling Problem with Multiple Modes

摘要：

We consider the resource-constrained project scheduling problem with multiple modes minimizing the makespan as objective, where an activity has different execution modes characterized by different duration and resource requirement combinations. In this study, we propose a novel activity list-based genetic algorithm which includes the local search for reduction of makespan using critical path to solve this NP-hard problem. To evaluate the performance, we implement the proposed approach on some standard instances as the computational experiment and compare the results with the several competitive heuristics in the literature.

关键词： resource-constrained project scheduling problem with multiple modes activity list-based genetic algorithm reduction procedure critical path improvement procedure

作者: Ikutaro Okada Xiao Fu Zhang Hong Yu Yang Shigeru Fujimura

作者单位: Department of Management and Business Kinki University Iizuka, Fukuoka 820-8555 Japan Graduate School of Information, Production & Systems Waseda University Kitakyushu, Fukuoka 808-0135

会议类型: 国际会议

会议名称: 2010 International Conference on Information Security and Artificial Intelligence(2010年信息安全与人工智能国际会议 ISAI 2010)

会议地点: 成都

会议语种:英文

页码: 286-291

在线出版日期: 2010-12-17（万方平台首次上网日期，不代表论文的发表时间）