oalib

Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99

Submit

Any time

2020 ( 55 )

2019 ( 234 )

2018 ( 275 )

2017 ( 293 )

Custom range...

Search Results: 1 - 10 of 223940 matches for " R. Panneerselvam "
All listed articles are free for downloading (OA Articles)
Page 1 /223940
Display every page Item
Efficient Heuristic to Minimize Makespan in Single Machine Scheduling Problem with Unrelated Parallel Machines  [PDF]
P. Sivasankaran, T. Sornakumar, R. Panneerselvam
Intelligent Information Management (IIM) , 2010, DOI: 10.4236/iim.2012.23022
Abstract: This paper discusses an efficient heuristic to minimize the makespan of scheduling n independent jobs on m unrelated parallel machines. The problem of scheduling the jobs on the unrelated parallel machines is combinatorial in nature. Hence, the heuristic approach is inevitable for quicker solution. In this paper, a simple and efficient heuristic is designed to minimize the makespan of scheduling n independent jobs on m unrelated parallel machines. A mathematical model is also presented for this problem. A factorial experiment is used to compare the results of the proposed heuristic with that of a mathematical model by taking “Method” (Heuristic and Model) as the first factor and “Problem Size” (No. of machines X No. of Jobs: 2X5, 2X6, ……, 2X9, 3X5, 3X6, ……, 3X9, ……., 5X5, 5X6, …5X9) as the second factor. It is found that there is no significant difference between the results of the proposed heuristic and that of the mathematical model. Further, the mean percent error of the results obtained by the heuristic from the optimal results obtained by the model is 2.336 %. The heuristic gives optimal solution for 76.67 % of the problems.
Triadimefon Mediated Changes in Antioxidant and Indole Alkaloid Content in Two Species of Datura
T. Sivakumar,R. Panneerselvam
American Journal of Plant Physiology , 2011,
Abstract: The triadimefon induced changes in antioxidant potential and alkaloid production of Datura fastuosa and Datura innoxia were studied. Both varieties were subjected to 15 mg L-1 triadimefon treatment by soil drenching on 55, 65 and 80 Days after Planting (DAP). The plants were harvested on 60, 75 and 90 DAP and used for analyzing antioxidant contents, antioxidative enzymes and indole alkaloid activities. The antioxidants like ascorbic acid, a-tocopherol and reduced glutathione were found increased under Triadimefon (TDM) treatment when compared to control plants. The antioxidative enzymes like superoxide dismutase, ascorbate peroxidase and catalase activities and indole alkaloid content increased in both the varieties under triadimefon treatment when compared to control (con) plants. The antioxidant potentials viz., Ascorbic Acid (AA), a-tocopherol and reduced Glutathione (GSH) were found increased under triadimefon treatment. The antioxidant enzymes like Superoxide Dismutase (SOD), Ascorbate Peroxidase (APX) and Catalase (CAT) activities showed slight changes in both the species under triadimefon treatment when compared to control plants. Indole alkaloid content increased significantly under triadimefon treatment. These preliminary results suggest that, the application of triadimefon may be a useful tool to increase the antioxidant potential and alkaloid content in medicinal plants.
Genomic relations among four Rhizophoraceae species under natural and afforested habitats of Pichavaram mangrove forest, Tamil Nadu, India
Jagadeesh S,Panneerselvam R
Journal of Environmental Science and Water Resources , 2012,
Abstract: Afforestation becomes essential to conserve and increase the forest area. Mangroves have many endangered species which requires conservation. During afforestation, the species encounters different edaphic and environmental factors. For adopting the new environment, the introduced species tend to change its morphological and physiological characters. To study the variation between the species at natural and afforested habitats, the following species were selected i.e., Rhizophora apiculata, Rhizophora mucronata, Bruguiera cylindrica and Ceriops decandra at the Pichavaram Mangrove forest and Mulukuturai (afforested area) mudflat of Tamil Nadu, India. Variation has been analyzed using RAPD and found there are variations between the species in the natural habitat itself at various degrees and no significant variation found within plants of natural habitat and afforested habitat, showing that these species are well adopted for afforestation in new areas like mudflats.
Non-genetic and genetic factors influencing growth performance in Murrah Buffalos
AK Thiruvenkadan, S Panneerselvam, R Rajendran
South African Journal of Animal Science , 2010,
Abstract: Live weight data from 590 Murrah buffalo calves (140 male and 450 female calves) maintained at the Central Cattle Breeding Farm, Alamadhi, Tamil Nadu, India, born in the period between 1990 and 2004 were used for this study. Data were analysed using least-squares procedures. The adjusted birth weights of male and female calves were 33.0 ± 0.49 and 31.9 ± 0.27 kg, respectively, with an overall value of 32.4 ± 0.30 kg. The mean body weight at three, six, nine and 12 months of age pooled over periods, season and sex were 62.0 ± 0.65, 87.9 ± 0.95, 112.4 ± 1.23 and 134.16 ± 1.41 kg, respectively. Period of calving influenced the weight significantly at birth, three and six months of ages only. The effect of dam parity on body weight at different ages was highly significant. The calves born during the dam’s second parity were generally heavier than those born in other parities. Generally, males had a higher body weight than females at all age groups. All the growth traits showed medium heritability (direct) estimates, which ranged between 0.12 ± 0.01 and 0.22 ± 0.16. The genetic correlations were all medium to high and positive. The genetic parameter estimates indicated that the six months weight can be used as a selection tool for genetic improvement of growth traits considering its high heritability and positive genetic correlations with succeeding growth traits.
Studies On Antifungal Activities Of Some Medicinal Plants Against Ceratocystis Paradoxa Causing Pineapple Disease
R Mahalingam,V Ambikapathy,A Panneerselvam
World Journal of Science and Technology , 2011,
Abstract: The antifungal properties of the leaf extracts of Pandanus odoratissimum, Cedrus deodara, Capparis zeylanica, Mirabilis jalapa, Eicchornia crasspies, Gardenia jasminoides, Spermacoce hispida, Nymphaea nouchali, Melothria heterophylla, Enicostemma littorale, against one pathogen isolates of Ceratocystis paradoxa isolated from sugarcan filds. The pathogen Ceratocystis Paradoxa causation Organism and commonly called the pineapple disease in sugar cane. The antifungal assay was determined by well diffusion method. Three different solvents such as Methanol, Ethanol and Aqueous were used. Among the three solvent methanolic extracts of all the treated plant leaves showed significant inhibitory activity followed by ethanol and aqueous extract. There was no activity found with aqueous extract of all the plant tested.
Design and Comparison of Simulated Annealing Algorithm and GRASP to Minimize Makespan in Single Machine Scheduling with Unrelated Parallel Machines  [PDF]
Panneerselvam Sivasankaran, Thambu Sornakumar, Ramasamy Panneerselvam
Intelligent Information Management (IIM) , 2010, DOI: 10.4236/iim.2010.27050
Abstract: This paper discusses design and comparison of Simulated Annealing Algorithm and Greedy Randomized Adaptive Search Procedure (GRASP) to minimize the makespan in scheduling n single operation independent jobs on m unrelated parallel machines. This problem of minimizing the makespan in single machine scheduling problem with uniform parallel machines is NP hard. Hence, heuristic development for such problem is highly inevitable. In this paper, two different Meta-heuristics to minimize the makespan of the assumed problem are designed and they are compared in terms of their solutions. In the first phase, the simulated annealing algorithm is presented and then GRASP (Greedy Randomized Adaptive Search procedure) is presented to minimize the makespan in the single machine scheduling problem with unrelated parallel machines. It is found that the simulated annealing algorithm performs better than GRASP.
Literature Review of Single Machine Scheduling Problem with Uniform Parallel Machines  [PDF]
Panneerselvam Senthilkumar, Sockalingam Narayanan
Intelligent Information Management (IIM) , 2010, DOI: 10.4236/iim.2010.28056
Abstract: This paper presents a survey of single machine scheduling problem with uniform parallel machines. The single machine scheduling problem with uniform parallel machines consists of n jobs, each with single operation, which are to be scheduled on m parallel machines with different speeds. These parallel machines are also called proportional machines or related machines. There are several measures of performance which are to be optimized in uniform parallel machines scheduling. Since, this scheduling problem is a combinatorial problem; usage of a heuristic is inevitable to obtain solution in polynomial time. This paper gives a classification of the literatures of this scheduling problem in three major categories, viz. offline scheduling, online scheduling and miscellaneous scheduling. In total, the available literatures are classified into 17 subgroups. Under each of the first two categories, the available literatures are discussed under different groups based on different measures of performance and non-preemptive/preemptive nature of the jobs. In the last category, the literatures are discussed under three subgroups, namely non-preemptive jobs, preemptive jobs and periodic jobs.
Simulated Annealing Algorithm to Minimize Makespanin Single Machine Scheduling Problem withUniform Parallel Machines  [PDF]
Panneerselvam Senthilkumar, Sockalingam Narayanan
Intelligent Information Management (IIM) , 2011, DOI: 10.4236/iim.2011.31003
Abstract: This paper presents a simulated annealing algorithm to minimize makespan of single machine scheduling problem with uniform parallel machines. The single machine scheduling problem with uniform parallel machines consists of n jobs, each with single operation, which are to be scheduled on m parallel machines with different speeds. Since, this scheduling problem is a combinatorial problem; usage of a heuristic is inevitable to obtain the solution in polynomial time. In this paper, simulated annealing algorithm is presented. In the first phase, a seed generation algorithm is given. Then, it is followed by three variations of the simulated annealing algorithms and their comparison using ANOVA in terms of their solutions on makespan.
Literature Review on Network Design Problems in Closed Loop and Reverse Supply Chains  [PDF]
Muthusamy Aravendan, Ramasamy Panneerselvam
Intelligent Information Management (IIM) , 2014, DOI: 10.4236/iim.2014.63012
Abstract:

The productivity of an organization is very much affected by non-value adding activity like logistics, which moves the resources from suppliers to factory, raw materials/semi-finished items within the factory and finished goods from factory to customers via a designated distribution channel called as forward logistics. In some cases, parts of the products such as automobiles, computers, cameras, mobile phones, washing machines, refrigerators, garments, footwear and empty glass bottles of beverages, etc. will be brought back to the factories as a product recovery strategy through reverse logistics network which is integrated in a sustainable closed loop supply chain network. So, it is highly essential to optimize the movement of the items in the reverse logistics network. This paper gives a comprehensive review of literature of the design of networks for the reverse logistics as well as for the reverse logistics coupled with forward logistics. The contributions of the researchers are classified into nine categories based on the methods used to design the logistics network.

An Integrated Multi-Echelon Model for a Sustainable Closed Loop Supply Chain Network Design  [PDF]
Muthusamy Aravendan, Ramasamy Panneerselvam
Intelligent Information Management (IIM) , 2014, DOI: 10.4236/iim.2014.66025
Abstract: The integration of entire supply and value chain into a closed loop network is gaining more importance in recent times in order to ensure a business to be economically and environmentally sustainable with the changing trends in business and social environments, growing environmental consciousness in the society and government legislations to protect the environment as well as the business. In this context, this paper considers a multi-echelon closed loop supply chain network design with forward and reverse logistics components. An attempt has been made to develop a mixed integer non-linear programming model for this problem with different costs so that the sum of the total cost is minimized subject to different constraints pertaining to capacities of the entities of the system, demands of first customers and second customers. A generalized model is presented and then its application is illustrated using an example problem by solving the model using LINGO14. This model forms as a tool to compare future meta-heuristics to check the closeness of their solutions with corresponding optimal solutions.
Page 1 /223940
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.