Title :
Site-based and resource-constrained project scheduling problem: Model and heuristics
Author :
Yuan-Li Zheng ; Yong-Liang Luo ; You-Fang Lin ; Zheng-Sheng Wei
Author_Institution :
Beijing Key Lab. of Traffic Data Anal. & Min., Beijing Jiaotong Univ., Beijing, China
Abstract :
In this paper, we present a site-based and resource-constrained project scheduling problem with generalized precedence relation (SRCPSP-GPR) by extending the RCPSP-GPR, in which the site constraints are considered to minimize project durations. After formalizing the SRCPSP-GPR, we give three concepts, i.e., Same-site activities, SubNet and Combined-SubNet, based on the precedence and site constraints. Then, we propose two heuristic algorithms to resolve this problem, the SubNet based search (SNBS) algorithm and the Combined-SubnNet based search (CSNBS) algorithm. The experimental results show that CSNBS is much more effective than SNBS, i.e., it can get more minimum project durations. However, the computational complexity of CSNBS is obviously larger than that of SNBS.
Keywords :
computational complexity; project management; resource allocation; scheduling; search problems; set theory; CSNBS algorithm; SRCPSP-GPR; combined-SubnNet based search algorithm; computational complexity; project duration minimization; same-site activities; site-based and resource-constrained project scheduling problem with generalized precedence relation; site-based project scheduling problem; Heuristic algorithms; Processor scheduling; Schedules; Scheduling; Time factors; Tin; Wireless sensor networks; Heuristics; Site-based and Resource-constrained Project Scheduling Problem with Generalized Precedence Relations; Site-constraints; SubNet;
Conference_Titel :
Wavelet Active Media Technology and Information Processing (ICCWAMTIP), 2013 10th International Computer Conference on
Conference_Location :
Chengdu
Print_ISBN :
978-1-4799-2445-5
DOI :
10.1109/ICCWAMTIP.2013.6716601