Heuristic approach for project scheduling problems with resource-duration interactions

Abstract

This thesis is concerned with a general class of resource-constrained project scheduling problems. Three resource-constrained project scheduling problems are investigated in consideration of project-dependent associated performance measures. The first problem considers a generally-classified resource-constrained project scheduling problem with the objective of minimizing the makespan of the project. Various operating modes are allowed to perform each activity in the project under the assumption that all activities are non-preemptive. For the problem, a branch-and-bound algorithm is considered by use of a depth-first search strategy employed for the associated tree search. The solution properties are explored so as to derive a lower bound computation procedure for the algorithm. The computational complexity of the lower bound computation is then investigated. For large-size problems, an efficient heuristic algorithm is also exploited by using partly the branch-and-bound algorithm. The second problem is a scheduling problem for a project where cash inflows and outflows are given and availability restrictions are imposed on capital and renewable resource. For each activity, various operating modes are allowed. The objective of the problem is to maximize the net present value of the project. By using both left-shift and right-shift mechanisms, a two phase heuristic algorithm is exploited. The third problem is concerned with a project scheduling problem where multiple objectives are simultaneously considered. Resource leveling criteria are also included in the problem. The problem is formulated as a goal programming (GP) model, where by considering objectives as flexible goals, a decision maker (DM) is able to obtain a satisfactory solution subject to desired requirements. A backtracking procedure is employed as a solution technique for the GP formulation model. An interactive decision is made in the whole solution search procedure such that DM specifies a target le...