Project Resource Scheduling with Time/Cost TradeOff

This paper present a new mixed integer model for project resource scheduling problem subject to some of the technological constraints such as time / cost trade-off in resource utilization and limited amount of budget. As the problem is classified as NP-Hard, a new heuristic method is developed for obtaining a near optimal solution in a reasonable run time. Computational experiences confirm the efficiency and efficacy of the model and the heuristic method.

Keywords:

Project Resource Scheduling , Time / Cost Trade-Off Budget , Mixed Integer Programming