Improvement of one trait on its own will affect the performance of other traits because ofgenotypic correlations between traits. Index selection is one of the tools used by plant breedersto overcome this problem. The purpose of this paper is to evaluate selection indices developedfor improving grain yield in rice (Oryza sativa L.). Forty-nine rice genotypes were cultivated atTonekabon Rice Rese...

Critical path method is a network based method planned for development and organization of complex project in real world application. In this paper, a new methodology has been made to find the critical path in a directed acyclic graph, whose activity time uncertain. The vague parameters in the network are represented by intuitionistic triangular fuzzy numbers, instead of crisp numbers. A new pr...

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...

TSP has been considered the most complex algorithmic problem because of its time complexity. TSP comes under the NP Complete problem that becomes more critical as the number of cities increases. In this present work, an effective solution to TSP is provided using genetic approach. The work has presented genetic based model to generate the TSP path in effective time. The improvement is here perf...

In this paper we study the complexity of a new class of a problem that we call the column-circular, subsets-selection problem and we show that, under a special condition, it is a polynomially solvable problem. First, we show that the column-circular set-partitioning, the column-circular set-covering, and the columncircular set-packing problems, among others, are special cases of the problem con...

Optimizing the scheduling algorithm is a key problem to improving service efficiency of urban heterogeneous computing platforms. In this paper, we propose novel list-based called Modified Predict Earliest Finish Time (MPEFT) for systems with aim minimize total execution time. The consists two stages: task prioritization and processor selection. phase, priority tasks calculated by time cost all ...

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...

Critical Path method (CPM) is widely used in project scheduling and controlling. In conventional project scheduling problem, the crisp numbers are used for the activity times. But in reality, in an imprecise and uncertain environment, it is an unrealistic assumption. To represent the uncertainty involved we have considered the interval-valued numbers to represent the activity times. In this pap...