An Imperialist Competitive Algorithm for Especial Case of Resource-Constrained Project Scheduling Problem

We consider the problem of scheduling project subject to setup time. Most approaches proposed in the literature so far are based on the unrealistic assumption that activity can start without any setup but in many realistic conditions job or resource must be prepared before a specific activity can be started. In order to shortest in this aspect of project scheduling we consider the project scheduling problem by additionally including setup times, which setup is necessary for some special resource . Each activities use these resource must be setup exactly before activities starting time and setup time depend on activities required amount of that resource in each period and also recourse must be available in duration of setup time. Problem aims is minimizing the project Completion Time. In order to complexity of introduced problem, an imperialist Competitive Algorithm proposed to solve the resource-constrained project scheduling problem. Computational results demonstrate the efficiency of the proposed algorithm compared to GA.

Keywords:

imperialist Competitive Algorithm , Resource-constrained project scheduling , Setup