{"title":"关键路径模型中前身-后继关系模拟的注解","authors":"G. Light","doi":"10.34257/GJSFRFVOL21IS2PG1","DOIUrl":null,"url":null,"abstract":"For any n entities, we exhaust all possible ordered relationships, from rank (or the highest number of connections in a linear chain, comparable to matrix rank) 0 to (n 1). As an example, we use spreadsheets with the “RAND” function to simulate the case of n = 8 with the order-length = 3, as from a total of 10000 possibilities by the number of combinations of selecting 2 (a pair of predecessor-successor) out of 5 (= card{A, B, C, D} + 1) matchingdestinations followed by an exponentiation of 4 (= 8 – card{A, B, C, D}). Since the essence of this paper is about ordered structures of networks, our findings here may serve multi-disciplinary interests, in particular, that of the critical path method (CPM) in operations with management. In this connection, we have also included, toward the end of this exposition, a linear algebraic treatment that renders a deterministic mathematical programming for optimal predecessorsuccessor network structures.","PeriodicalId":12547,"journal":{"name":"Global Journal of Science Frontier Research","volume":"28 1","pages":"1-6"},"PeriodicalIF":0.0000,"publicationDate":"2021-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Note on Simulating Predecessor-Successor Relationships in Critical Path Models\",\"authors\":\"G. Light\",\"doi\":\"10.34257/GJSFRFVOL21IS2PG1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For any n entities, we exhaust all possible ordered relationships, from rank (or the highest number of connections in a linear chain, comparable to matrix rank) 0 to (n 1). As an example, we use spreadsheets with the “RAND” function to simulate the case of n = 8 with the order-length = 3, as from a total of 10000 possibilities by the number of combinations of selecting 2 (a pair of predecessor-successor) out of 5 (= card{A, B, C, D} + 1) matchingdestinations followed by an exponentiation of 4 (= 8 – card{A, B, C, D}). Since the essence of this paper is about ordered structures of networks, our findings here may serve multi-disciplinary interests, in particular, that of the critical path method (CPM) in operations with management. In this connection, we have also included, toward the end of this exposition, a linear algebraic treatment that renders a deterministic mathematical programming for optimal predecessorsuccessor network structures.\",\"PeriodicalId\":12547,\"journal\":{\"name\":\"Global Journal of Science Frontier Research\",\"volume\":\"28 1\",\"pages\":\"1-6\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-04-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Global Journal of Science Frontier Research\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.34257/GJSFRFVOL21IS2PG1\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Global Journal of Science Frontier Research","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.34257/GJSFRFVOL21IS2PG1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Note on Simulating Predecessor-Successor Relationships in Critical Path Models
For any n entities, we exhaust all possible ordered relationships, from rank (or the highest number of connections in a linear chain, comparable to matrix rank) 0 to (n 1). As an example, we use spreadsheets with the “RAND” function to simulate the case of n = 8 with the order-length = 3, as from a total of 10000 possibilities by the number of combinations of selecting 2 (a pair of predecessor-successor) out of 5 (= card{A, B, C, D} + 1) matchingdestinations followed by an exponentiation of 4 (= 8 – card{A, B, C, D}). Since the essence of this paper is about ordered structures of networks, our findings here may serve multi-disciplinary interests, in particular, that of the critical path method (CPM) in operations with management. In this connection, we have also included, toward the end of this exposition, a linear algebraic treatment that renders a deterministic mathematical programming for optimal predecessorsuccessor network structures.