نتایج جستجو برای: critical path method
تعداد نتایج: 2161279 فیلتر نتایج به سال:
-Cloud computing, as a new model of service provision in distributed computing environment, faces the great challenge of energy consumption because of its large demand for computing resources. Choosing improper scheduling method to execute cloud workflow tends to result in the waste of power consumption. In order to lower the higher power consumption for cloud workflow executing, we propose a p...
Technology scaling and manufacturing process affect the performance of digital circuits, making them more vulnerable to environmental influences. Some defects are shown as delay faults therefore their testing is very important, mainly path delay faults. Such faults are tested over critical paths which have to be specified in a digital circuit. A problem of the critical paths selection is discus...
A new parallel-in-parallel-out bit-level pipelined multi-plier is presented to perform multiplication in GF(2 m). The existing designs use m 2 identical cells each having 7 latches and have a system latency of 3m. We start with the Dependence Graph (DG) of the algorithm and pipleine it to achieve a critical path equal to the delay of a 2-input AND and XOR gate. The critical path in the proposed...
Observations from past earthquakes, such as the 1906 San Francisco earthquake, the 1994 Northridge earthquake, and the 1995 Hyogoken-Nanbu (Kobe) earthquake, have clearly demonstrated that compromising water supply systems after an earthquake not only impairs fire fighting capacity, but also disrupts residential, commercial, and industrial activities, and threatens the economic well-being, secu...
The task of balancing of assembly lines is well-known in mass production system but this problem is NP-hard even for the simple straight line. Therefore, utilizing heuristic methods for these problems is totally unquestionable. Furthermore, in line with balancing problems, heuristic methods are the foundation of the metaheuristic methods, thus it seems to be necessary to use more efficient heur...
the above equation, we can see that we will get the best performance if we choose a blocking factor that is a multiple of 3. In general, the theorem implies that there are only blocking factors to consider; this characterizes the critical path for all unfoldings greater than. In this paper, we have developed a formulation for the problem of finding optimal blocking factors for blocked, non-over...
The classical PERT approach uses the path with the largest expected duration as the critical path to estimate the probability of completing a network by a given deadline. However, in general, such a path is not the most critical path (MCP) and does not have the smallest estimate for the probability of completion time. The main idea of this paper is derived from the domination structure between ...
This paper addressed a Flexible Job shop Scheduling Problem (FJSP) with the objective of minimization of maximum completion time (Cmax) which job splitting or lot streaming is allowed. Lot streaming is an important technique that has been used widely to reduce completion time of a production system. Due to the complexity of the problem; exact optimization techniques such as branch and bound alg...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید