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

Gregory L Light
Gregory L Light
Gregory L. Light
Gregory L. Light

Send Message

To: Author

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

Article Fingerprint

ReserarchID

CZSQ1

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

AI TAKEAWAY

Connecting with the Eternal Ground
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu
Font Type
Font Size
Font Size
Bedground

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.

References

11 Cites in Article
  1. Donald Conant (2018). Examining critical and near-critical paths: an Excel-based classroom exercise.
  2. W Winston,S Albright (1997). Practical Management Science Spreadsheet Modeling and Applications.
  3. T Sing,J Ooi,A Wong,P Lum (2006). Network connectivity and office occupiers' space decision: the case of Suntec City.
  4. Ascensión Martínez,Ramón Galván,Tomás Palacios (2013). Study of factors influencing knowledge transfer in family firms.
  5. T Iryo,H Mori,H Kitaoka,M Ishida,Y Asakura (2012). Traffic flow model of network simulators for estimation of CO.
  6. Yu Cheng (1996). Optimal train traffic rescheduling simulation by a knowledge-based system combined with critical path method.
  7. Alicia Sendrowski,Paola Passalacqua (2017). Process connectivity in a naturally prograding river delta.
  8. Jörg Keller,Thomas Rauber,Bernd Rederlechner (1999). Scalability Analysis for Conservative Simulationof Logical Circuits.
  9. A Mahmood,J Herath,J Jayasumana (1994). An Improved Data Flow Architecture for LogicSimulation Acceleration.
  10. K Karol,B Andrea (2003). Development of control system by Studgard neural network simulator.
  11. K Kiran,P Maneeth (2015). 14 TIME-COST OPTIMIZATION OF A PROJECT TIME-COST OPTIMIZATION OF A PROJECT.

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

How to Cite This Article

Gregory L Light. 2021. \u201cA Note on Simulating Predecessor-Successor Relationships in Critical Path Models\u201d. Global Journal of Science Frontier Research - F: Mathematics & Decision GJSFR-F Volume 21 (GJSFR Volume 21 Issue F2).

Download Citation

Journal Specifications

Crossref Journal DOI 10.17406/GJSFR

Print ISSN 0975-5896

e-ISSN 2249-4626

Keywords
Classification
GJSFR-F Classification MSC 2010: 91G50
Version of record

v1.2

Issue date
April 16, 2021

Language
en
Experiance in AR

Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.

Read in 3D

Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.

Article Matrices
Total Views: 2153
Total Downloads: 997
2026 Trends
Related Research
Our website is actively being updated, and changes may occur frequently. Please clear your browser cache if needed. For feedback or error reporting, please email [email protected]

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

Quote and Order Details

Contact Person

Invoice Address

Notes or Comments

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

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

Gregory L. Light
Gregory L. Light

Research Journals