Suppose that a project consists of n separate tasks and one and only one task can be completed in one time period. However, since some tasks can be started only before others have been completed, only feasible task schedules are considered. There is a cost associated with the time at which a task is completed and the project cost is equal to the sum of all the task costs. How can a feasible task schedule with minimum project cost be found for completing the entire project? This research proposes using a genetic algorithm to solve this problem efficiently.
Gargano, Michael L. and Quintas, Louis V.
"Feasible Task Schedules With Minimum Project Cost Solved By A Genetic Algorithm,"
Communications of the IIMA: Vol. 6
, Article 8.
Available at: http://scholarworks.lib.csusb.edu/ciima/vol6/iss2/8