Abstract

This paper examined the problem of project-based project scheduling [1] with resource constraints for minimizing early and late charges considering fixed workload for activities, prerequisite relationships, and the constraint of renewable resources. As activities have a certain maturity, penalties are considered for early and late activities out of their maturity. Meta-heuristic genetic and annealing simulation algorithms were designed and the parameters of these algorithms were set using Taguchi method to solve this problem. A set of sample problems was solved to examine the performance of these two algorithms, and using statistical tests the solutions of the two algorithms were compared.