An Intelligent Method for Multi Processor Scheduling using Memetic Algorithms


Moghadam R. A. , Nejad P. A.

9th WSEAS International Conference on Signal Processing, Computational Geometry and Artificial Vision, Moscow, Rusya, 20 - 22 Ağustos 2009, ss.165-166 identifier

  • Basıldığı Şehir: Moscow
  • Basıldığı Ülke: Rusya
  • Sayfa Sayıları: ss.165-166

Özet

One of the key important issues in project management is tradeoff between cost and time in such a way that the project is completed in the shortest time and minimum cost. Memetic Algorithm (MA) is a practical approach for such optimization problems. In this paper, an algorithm is presented to solve the Time-Cost Tradeoff Problem (TCTP) using memetic algorithm. In this algorithm in order to search the problem space a control variable is used. Also an intelligent operator based on hill climbing technique is presented to approximate to the project's optimal point. Comparing this algorithm with Siemens classical algorithm shows the higher speed of proposed algorithm because in this algorithm many computations of paths in project's network graph are not needed