A SCHEDULING PROCEDURE FOR A GENERAL-CLASS OF RESOURCE-CONSTRAINED PROJECTS

This paper introduces a solution algorithm derived and based on branch -and-bound procedures to solve a generally-classified resource-constra ined project scheduling problem where various operating modes are allo wed to perform each activity in the project and all activities are non -preemptive. With the objective of minimizing the makespan of the proj ect, two lower bound computation procedures are derived for the associ ated tree search algorithm where a depth-first search strategy is empl oyed. An efficient heuristic algorithm for large-size problems is also exploited by using partly the branch-and-bound algorithm. Both algori thms are tested with various numerical problems for their effectivenes s and efficiences. Copyright (C) 1997 Elsevier Science Ltd