A Tabu Search Approach for the Resource ConstrainedProject Scheduling Problem

  • Authors:
  • Paul R. Thomas;Said Salhi

  • Affiliations:
  • Management Mathematics Group, School of Mathematics and Statistics, University of Birmingham, U.K.;Management Mathematics Group, School of Mathematics and Statistics, University of Birmingham, U.K.

  • Venue:
  • Journal of Heuristics
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

An appropriate tabu search implementation is designed to solvethe resource constrained project scheduling problem. Thisapproach uses well defined move strategies and a structuredneighbourhood, defines appropriate tabu status and tenure andtakes account of objective function approximation to speed upthe search process. A sound understanding of the problem hashelped in many ways in designing and enhancing the tabu searchmethodology. The method uses diversification, intensification andhandles infeasibility via strategic oscillation.The above methodology is tested on existing problems from theliterature and also on parametrically generated problems withencouraging results. For comparison of results, optimalsolutions are used in the former and lower bounds obtained byLagrangian heuristics are used in the latter.