An approach with Decomposition on Time Windows for Resource-Constrained Project Scheduling

摘要：

　　An approach with decomposition on time windows is proposed to solve resource-constrained project scheduling problem(RCPSP)in this paper.This approach is to decompose the feasible space calculated by CPM of the original problem into some subspaces,which are searched using some schedule schema.Double justification is also performed in the search to improve the results.The results of experiments conducted on PSPLIB show the proposed method is effective and efficient.

关键词： Decomposition on Time Windows Project Scheduling Random Sampling Scheduling Schema Double Justification

作者: Jing Tian Zhenyuan Liu Wenmin Yu

作者单位: College of Automation,Huazhong University of Science and Technology,Wuhan city 430074,China

会议类型: 国际会议

会议名称: 第26届中国控制与决策会议(2014 CCDC)

会议地点: 长沙

会议语种:英文

页码: 4897-4903

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