DocumentCode
177116
Title
An approach with decomposition on time windows for resource-constrained project scheduling
Author
Jing Tian ; Zhenyuan Liu ; Wenmin Yu
Author_Institution
Coll. of Autom., Huazhong Univ. of Sci. & Technol., Wuhan, China
fYear
2014
fDate
May 31 2014-June 2 2014
Firstpage
4897
Lastpage
4903
Abstract
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.
Keywords
project management; scheduling; RCPSP; decomposition on time windows; double justification; resource-constrained project scheduling problem; schedule schema; Algorithm design and analysis; Educational institutions; Heuristic algorithms; Processor scheduling; Schedules; Scheduling; Search problems; Decomposition on Time Windows; Double Justification; Project Scheduling; Random Sampling; Scheduling Schema;
fLanguage
English
Publisher
ieee
Conference_Titel
Control and Decision Conference (2014 CCDC), The 26th Chinese
Conference_Location
Changsha
Print_ISBN
978-1-4799-3707-3
Type
conf
DOI
10.1109/CCDC.2014.6853050
Filename
6853050
Link To Document