Thomas, Paul and Salhi, Said (1998) A Tabu Search Approach for the Resource Constrained Project Management Problem. Journal of Heuristics, 4 (2). pp. 123-139. ISSN 1381-1231 . (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)
An appropriate tabu search implementation is designed to solve the resource constrained project scheduling problem. This approach uses well defined move strategies and a structured neighbourhood, defines appropriate tabu status and tenure and takes account of objective function approximation to speed up the search process. A sound understanding of the problem has helped in many ways in designing and enhancing the tabu search methodology. The method uses diversification, intensification and handles infeasibility via strategic oscillation. The above methodology is tested on existing problems from the literature and also on parametrically generated problems with encouraging results. For comparison of results, optimal solutions are used in the former and lower bounds obtained by Lagrangian heuristics are used in the latter.
|Subjects:||H Social Sciences|
|Divisions:||Faculties > Social Sciences > Kent Business School > Management Science|
|Depositing User:||Said Salhi|
|Date Deposited:||24 Jun 2009 16:16|
|Last Modified:||04 Jun 2014 13:40|
|Resource URI:||https://kar.kent.ac.uk/id/eprint/5272 (The current URI for this page, for reference purposes)|