By Topic

Finding a hybrid genetic algorithm-constraint satisfaction problem based solution for resource constrained project scheduling

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Mohammad Amin Rigi ; K. N. Toosi University of Technology, Industrial faculty, IT group Tehran, Iran ; Shahriar Mohammadi

Project scheduling has attracted many researchers in recent years. It is about single-item or small batch production where scarce resources have to be met when scheduling dependent activities over time. Because of high complexity of the problem uninformed search strategies cannot solve the problem optimally. This paper proposes a new evolutionary approach to resource constrained project scheduling problem. Hybrid genetic algorithm (GA)-constraint satisfaction problem (CSP) has been applied to solve resource constrained project scheduling (RCPS). GA's task is to find the best schedule. Discussed approach has used CSP in order to overcome the existing inconsistencies in activities precedence and resources conflicts. A full state CSP with min-conflict heuristic has been used for solving precedence conflicts. And a simple iterative CSP is used to resolve the resource conflicts.

Published in:

Emerging Technologies, 2009. ICET 2009. International Conference on

Date of Conference:

19-20 Oct. 2009