Method of founding criterion network with maximum dummy activities

Network planning technology could simplify and represent many difficult problems in project management, and make them could be solved by using correlative method easily. But it also has some obvious defects, for example, (1) direction character of network illuminates that dynamic programming is effective algorithm to resolve it in many circs, but non-phases of network in generally makes the algorithm couldn´t be used directly; (2) network which founded arbitrarily may be intricate easily in presentation, which is difficult of being studied; (3) in network planning, problem of how to found activity-on-arc representation network with the least dummy activities is NP-hard, therefore many different networks may be founded for one activity system, which blocks study on scheduling and planning management, etc. It could help to resolve above problems if network could be transformed to multi-phases network which named criterion network. In this paper, properties of criterion network are analyzed, and problem of how to found criterion network of any network by founding linear programming model is solved, and problems of how many dummy activities need be added at most and how to add them are also solved, and then scale of criterion network is estimated.