The purpose of the critical path method (CPM) is to identify the critical activities in the critical path of an activity network. In the real world for many projects we have to use human judgment for estimating the duration of activities. However, the unknowns or vagueness about the time duration for activities in network planning, has led to the development of fuzzy CPM. A way to deal with thi...

The Critical Path Method (CPM) is a vital tool for the planning and control of complex projects. The successful implementation of CPM requires the availability of a clear determined time duration for each activity. However, in practical situations this requirement is usually hard to fulfill since many of activities will be executed for the first time. Hence, there is always uncertainty about th...

Hubs are critical elements of transportation networks. Location of hubs and allocation of demands to them are of high importance in the network design. The most important purpose of these models is to minimize the cost, but path reliability is also another important factor which can influence the location of hubs. In this paper, we propose a P-center hub location model with full interconnection...

Figuring out why a process in a batch window ended late often requires tracing back through the critical path to look for anomalies. In a complicated batch schedule, determining which jobs are on the critical path can be a seemingly daunting task. Various commercial products can be used for this task, but they may not be necessary. The code needed to determine which predecessor jobs constitute ...

In this paper, we focus on the problem of secure multicast in dynamic groups. In this problem, a group of users communicate using a shared key. Due to the dynamic nature of these groups, to preserve secrecy, it is necessary to change the group key whenever the group membership changes. While the group key is being changed, the group communication needs to be interrupted until the rekeying is co...

In this study a new approach to rank exponential fuzzy numbers using  -cuts is established. The metric distance of the interval numbers is extended to exponential fuzzy numbers. By using the ranking of exponential fuzzy numbers and using  -cuts the critical path of a project network is solved and illustrated by numerical examples. Keywords: Exponential Fuzzy Numbers,  -cuts, Metric Dista...

This paper is an introduction to the problem of Critical Path determination in the context of Timing Veriication. After correct logic veriication, timing is the next most important concern to be addressed by designers. The speed of a circuit is related to the length of the longest path through which a signal can travel, also known as the longest true path or critical path of the circuit. This p...

Modern processors come close to executing as fast as true dependencies allow. The particular dependencies 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 path. This paper describes ...

This paper proposes “path mapping”, a method of delay estimation for technology independent combinational circuits. Path mapping provides fast and accurate delay estimation using the common ideas with the tree covering based technology mapping. First, path mapping does technology mapping for all paths in the circuit with minimum delay. Then, it finds the most critical path among all the paths i...