421 As a matter of fact, they are from 5 different cognate ternary pairs as listed above. According to the definition cognate and the tardiness theory of the normalized ternary pair, cognate ternary pairs have the same normalization result. Therefore, any five of different cognate ternary pairs can represent total 15 different standard ternary pairs. We can select the first one from each monolo...

This paper presents a new algorithm that obtains an approximation of the Critical Path in schedules generated using the disjunctive graph model that represents the Job Shop Scheduling Problem (JSSP). This algorithm selects a set of operations in the JSSP, where on the average ninety nine percent of the total operations that belong to the set are part of the critical path. A comparison is made o...

a considerable problem in competitive trade world is choosing the best supply chain. as a result in much more serious circumstances of competitions looking for the best supplier for manufacturing, for preparing raw material, is very significant. meantime suppliers have different scenarios to be fulfilled, such as changing selection variables like lead-time, transportation cost and transportatio...

Problem (JSSP) to evaluate the neighborhoods functions that use the non-deterministic algorithms is the calculation of the critical path in a digraph. This paper presents an experimental study of the cost of computation that exists when the calculation of the critical path in the solution for instances in which a JSSP of large size is involved. The results indicate that if the critical path is ...

Geo Spatial information is a large collection of datasets referring to the real world entities. Geo Spatial information has evolved in the last decade which led to produce a vast platform in Government Administration, Scientific Analysis and other various sectors especially in disaster management (DM), site suitability of Check-dams for Irrigation Department etc. It is required to obtain impera...

The critical path of a group of tasks is an important measure that is commonly used to guide task allocation and scheduling on parallel computers. The critical path is the longest chain of dependencies in an acyclic task dependence graph. A problem arises on heterogeneous parallel machines where computation and communication costs can vary between different types of processor. Existing solution...

the problem of finding the minimum cost multi-commodity flow in an undirected and completenetwork is studied when the link costs are piecewise linear and convex. the arc-path model and overflowmodel are presented to formulate the problem. the results suggest that the new overflow model outperformsthe classical arc-path model for this problem. the classical revised simplex, frank and wolf and a ...

As processor reliability becomes a first order design constraint, this research argues for a need to provide continuous reliability monitoring. We present an adaptive critical path monitoring architecture which provides accurate and real-time measure of the processor’s timing margin degradation. Special test patterns check a set of critical paths in the circuit-under-test. By activating the act...

We propose a min-flow algorithm for detecting Minimal Critical Sets (MCS) in Resource Constrained Project Scheduling Problems (RCPSP). The MCS detection is a fundamental step in the Precedence Constraint Posting method (PCP), one of the most successful approaches for the RCPSP. The proposed approach is considerably simpler compared to existing flow based MCS detection procedures and has better ...