Graph-based constraints analysis approach for project scoping

摘要

Project scoping is a changeable problem in project management. In this paper, a graph-based constraints analysis approach was proposed to solve the project scoping problem. It firstly build a directed graph based on the dependencies among the requirements, secondly update the connected graph based on user defined inclusive and exclusive constraints, thirdly find the connected sub-graph set, fourthly verify the constraints for sub-graph and determine all candidate sub-graph sets, and finally determine solution for the project scoping problem through solving a Knapsack problem. The proposed approach was illustrated through a simple example and validated by real cases. Through the experiments, the proposed approach is efficient and validate in practice.