An Exchange Heuristic Algorithm for Project Scheduling with Limited Resources

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 1002
  • Download : 0
In this paper an effective search-type heuristic algorithm for the problems of scheduling activities under resource and precedence constraints is presented. Such problems are typically massive in size and combinatorially explosive. The algorithm to solve these problems consists of two phases (both of which are heuristic). Phase I develops a “good” initial solution. Phase II then employs the solution derived in Phase I as a starting point; attempting to manipulate this schedule so as to reduce the project completion time via suitable reshuffles, or rearrangements of the activities while maintaining feasibility. A random problem generator and a random active schedule generator were prepared and utilized to evaluate the performance of the algorithm.
Publisher
Taylor & Francis
Issue Date
1989-12
Language
English
Citation

ENGINEERING OPTIMIZATION, v.14, no.3, pp.189 - 205

ISSN
0305-215X
URI
http://hdl.handle.net/10203/64759
Appears in Collection
RIMS Journal Papers
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0