562015-03-24 , 法政大学大学院理工学・工学研究科
We develop approximate and strict methods for resolving resource conflicts in the critical chain project management (CCPM) method. The CCPM method consists of (1) identifying tasks of a project, (2) collection of time margins, (3) resolution of resource conflicts, (4) classifying tasks according to critical or non-critical tasks, and (5) insertion of time buffers. There are effective approaches for four of the five processes. However, for the remaining one process which resolves resource conflicts, an effective method has yet to be proposed. Hence, we develop several approximate solving methods based on using a local search or genetic algorithm. Through numerical experiments, we found that the developed methods are practical. In addition, the strict method can find the optimal solution if the number of tasks is smaller than 20.