A Genetic Algorithm based Solution with Schedule Mode for RCPSP
作者单位：School of Economics and ManagementShenyang Ligong University
会议名称：《2011 International Conference on Advanced Materials and Information Technology Processing(AMITP 2011)》
会议日期：2011年
学科分类：12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 081104[工学-模式识别与智能系统] 08[工学] 0835[工学-软件工程] 0811[工学-控制科学与工程] 0812[工学-计算机科学与技术（可授工学、理学学位）]
基 金：partially supported by National Science Foundation of China 71071100
关 键 词：Genetic Algorithm,Resource constrained Project Scheduling,Meta heuristic
摘 要：Resource-Constrained Project Scheduling Problem(RCPSP) is a well-known NP hard problem and more intelligent optimization algorithms are developed to solve it. In this paper, genetic algorithm(GA) is employed to deal with RCPSP. A priority value encoding scheme is designed to in the algorithm. The numerical results indicate that our methods is slightly better as far as solution quality is concerned and requires smaller solution time than the GA where an activity list encoding with schedule mode is used.