DocumentCode
3570421
Title
Tabu search approach for Multi-Skill Resource-Constrained Project Scheduling Problem
Author
Skowronski, Marek E. ; Myszkowski, Pawel B. ; Adamski, Mariusz ; Kwiatek, Pawel
Author_Institution
Dept. of Artificial Intell., Wroclaw Univ. of Technol., Wrocław, Poland
fYear
2013
Firstpage
153
Lastpage
158
Abstract
In this article two approaches of Tabu Search in Multi-Skill Resource-Constrained Project Scheduling Problem (MS-RCPSP) have been proposed, based on different neighbourhood generation methods. The first approach assumes swapping resources assigned to pair of tasks, while the second one proposes assigning any resource that could perform given task. Both approaches need to respect the skill constraints. The objective of this paper is to research the usability and robustness of proposed approaches in solving MS-RCPSP. Experiments have been performed using artificially created dataset instances, based on real-world instances, got from Volvo IT and verified by experienced project manager. Presented results show that Tabu Search (TS) based methods are efficient approaches that could be developed in the further work.
Keywords
project management; scheduling; search problems; MS-RCPSP; Volvo IT; dataset instances; multiskill resource-constrained project scheduling problem; neighbourhood generation methods; project manager; swapping resources; tabu search approach; usability; Optimization; Processor scheduling; Robustness; Schedules; Scheduling; Standards; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Science and Information Systems (FedCSIS), 2013 Federated Conference on
Type
conf
Filename
6643991
Link To Document