A Note on Simulating Predecessor-Successor Relationships in Critical Path Models

Authors

  • Gregory L. Light

CPM simulation, directed graphs, ordered networks, circuitry designs, logical flows

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.

How to Cite

A Note on Simulating Predecessor-Successor Relationships in Critical Path Models. (2021). Global Journal of Science Frontier Research, 21(9), 1-6. https://doi.org/10.34257/GJSFRFVOL21IS2PG1

URL: https://www.journalofscience.org/index.php/GJSFR/article/view/2925

References

D. Conant (2018) D., Examining critical and near-critical paths: an Excel-based classroom exercise, J Edu. 93(6), 285-291.

W. Winston, S. Albright (1997) Practical Management Science, Spreadsheet Modeling and Applications.

T. Sing, J. Ooi, A. Wong, P. Lum Network connectivity and office occupiers' space decision: the case of Suntec City.

Ascensión Martínez, Ramón Galván, Tomás Palacios (2013) B., Galván, R S and Palacios, T B., Study of factors influencing knowledge transfer in family firms, Intang. 9(4), 1216-1238.

T. Iryo, H. Mori, H. Kitaoka, M. Ishida, Y. Asakura (2012) Asakura, Y., Traffic flow model of network simulators for estimation of CO, J Adv. 46(3), 290-301.

Y. Cheng (1996) Optimal train traffic rescheduling simulation by a knowledge-based system combined with critical path method. 4(6), 399-413.

Process connectivity in a naturally prograding river delta. 53.

Jörg Keller, Thomas Rauber, Bernd Rederlechner (1999) Rederlechner, B., Scalability Analysis for Conservative Simulation of Logical Circuits, VLSI Design, 9 (3). 9(3), 219-235. https://doi.org/10.1155/1999/14802

A. Mahmood, J. Herath, J. Jayasumana (1994) Jayasumana, J., An Improved Data Flow Architecture for Logic Simulation Acceleration, VLSI Design, 2 (3). 2(3), 259-265.

K. Karol, B. Andrea (2003) Andrea, B., Development of control system by Studgard neural network simulator, Acta Montanistica Slov., 8 (4). 8(4), 217-219.

K. Kiran, P. Maneeth (2015) Maneeth P., Optimization of Time Restriction in Construction Project Management Using Lingo and M S Excel, Int J Engin Res. 5(9), 79-89.

A Note on Simulating Predecessor-Successor Relationships in Critical Path Models

Published

2021-03-29

How to Cite

A Note on Simulating Predecessor-Successor Relationships in Critical Path Models. (2021). Global Journal of Science Frontier Research, 21(9), 1-6. https://doi.org/10.34257/GJSFRFVOL21IS2PG1