✦ LIBER ✦

The most critical path in a PERT network: A heuristic approach

✍ Scribed by H.M. Soroush

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 913 KB
Volume: 78
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(94)90124-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A compact hash function for paths in PER

A compact hash function for paths in PERT networks

✍ Vidyadhar G. Kulkarni 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 184 KB

A simple approach to fuzzy critical path

A simple approach to fuzzy critical path analysis in project networks

✍ Shih-Pin Chen; Yi-Ju Hsueh 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 162 KB

An algorithm for determining the most re

An algorithm for determining the most reliable path of a network

✍ V.K. Jain; Krishna Gopal 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 156 KB

Determination of the most reliable path

Determination of the most reliable path of a planar flow network

✍ Dong Wha Lee; Bong Jin Yum 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 406 KB

A heuristic approach to resource locatio

A heuristic approach to resource locations in broadband networks

✍ P.C. Saxena; D.R. Choudhury; G. Gabrani; S. Gupta; M. Bhardwaj; M. Chopra 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 674 KB

In broadband networks, such as ATM, the importance of dynamic migration of data resources is increasing because of its potential to improve performance especially for transaction processing. In environments with migratory data resources, it is necessary to have mechanisms to manage the locations of

Complexity of the minimum-dummy-activiti

Complexity of the minimum-dummy-activities problem in a pert network

✍ M. S. Krishnamoorthy; N. Deo 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 301 KB