The critical path problem is a classical and important network optimization problem appearing in many applications, especially in planning and controlling the complex projects. However the result of classical critical path method computation cannot properly match the real-world problem. This gives rise to fuzzy environment and hence we have fuzzy critical path method. In this paper, two differe...

One of the projects currently being undertaken by PT. XYZ is Dam “X”. Based on project management data obtained from XYZ, actual construction process experienced a significant delay planned schedule, with duration approximately 30 days. The will have an impact final completion project, including delivering results to consumers. purpose this study determine critical path in implementation and id...

In fuzzy decision systems, we model insuring critical path problem by two-stage risk-aversion fuzzy programming. For the proposed two-stage insuring critical path problem, we first define three solution concepts, expected value solution, wait-and-see solution and here-and-now solution, then introduce the value of perfect information of value-at-risk (VaRVPI) and the value of the fuzzy solution ...

A natural generalization of the criticality notion in a network with fuzzy activity times is given. It consists in direct application of the extension principle of Zadeh to the notion of criticality of a path (an activity, an event) treated as a function of the activities duration times in the network. There are shown some relations between the notion of fuzzy criticality, introduced in the pap...

nowadays, issues such as global climate change, poverty and inequity, and the unsustainable use of resources are driving organizations to incorporate the principles of sustainable development into projects. sustainable development of organizations and companies requires consideration of all three sustainability dimensions: environmental, economic and social should integrate economic, social and...

Modern processors come close to executing as fast as true dependences allow. The particular dependences that constrain execution speed constitute the critical path of execution. To optimize the performance of the processor, we either have to reduce the critical path or execute it more efficiently. In both cases, it can be done more effectively if we know the actual instructions that constitute ...

being observed frequently that projects cannot achieve to their plan duration and their budget. utilizing retrospective method is one of the reasons for this problem. in this research two method, earned duration management and risk management, has been used to remove the gap of the plan and the reality; this enable the project to utilize both high accuracy of the first method and prophecy of th...

A new readout approach for the Hamiltonian Path Problem (HPP) in DNA computing based on the real-time polymerase chain reaction (PCR) is investigated. Several types of fluorescent probes and detection mechanisms are currently employed in real-time PCR, including SYBR Green, molecular beacons, and hybridization probes. In this study, real-time amplification performed using the TaqMan probes is a...

Adleman [1] showed that deoxyribonucleic acid (DNA) strands could be employed towards calculating solutions to an instance of the Hamiltonian path problem (HPP). Lipton [5] also demonstrated that Adlemans techniques could be used to solve the Satisfiability problem. In this paper, we use Adleman-Lipton model for developing a DNA algorithm to solve Maximum k-colourable Sub graph problem. In spit...