Loading...
Please wait, while we are loading the content...
Similar Documents
A Tabu Search Algorithm for the Resource-constrained Project Scheduling Problem
| Content Provider | Semantic Scholar |
|---|---|
| Author | Gagnon, Michel Boctor, Fayez F. D'Avignon, Gilles |
| Copyright Year | 2004 |
| Abstract | This paper presents a new tabu search algorithm to solve the Resource-Constrained Project Scheduling problem with variable resource availability. It investigates the efficiency of a neighborhood structure based on activity sequences where the precedence constraints are maintained. Sequences are evaluated through a listscheduling algorithm to obtain the project duration of the corresponding schedules. The neighborhood structure is adopted in order to implement various strategies to reduce the computation time. Numerical experimentations show that the proposed algorithm provides competitive quality solutions compared to other heuristics proposed in the literature and it provides the best-known solutions to two wellknown benchmark problem sets. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://attila.acadiau.ca/library/ASAC/v25/articles/Gagnon-Boctor-Davignon.pdf |
| Alternate Webpage(s) | http://libra.acadiau.ca/library/ASAC/v25/articles/Gagnon-Boctor-Davignon.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |