A SA algorithm for eost oriented RACP with diserete time resource tradeoff

Abstract-this paper considers a project scheduling problem in which the maximum availability of resources is decision is to determine a mode and a starting time for each activity so that all constraints are obeyed and cost of resorce requirements and tardiness are minimized . all of the precedence relatinships annceling approach is proposed to solve this problem. compulational results have been renorted and the efficiency of the proposed model has been analvzed

Keywords:

Keywords-project scheduling , resource availabitlity cost problem , simulated annealing