This paper presents an algorithm for numbering nodes of arrow diagram and adding dummy jobs (dummy activities)in planning and scheduling networks. In the last part of the article, a brief description of the analysis of T-complexity is given.