20 resultados para Multiprocessor scheduling with resource sharing

em Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho"


Relevância:

100.00% 100.00%

Publicador:

Resumo:

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Dominant species are those which delimit and defend territories from other individuals of the same or different species. Subordinate species are those which, furtive and sneakily, use sources of nectar from other individuals. This study aimed to describe the aggressive interactions between species of hummingbirds, define which species are dominant and which are subordinate, investigate if the sharing of resources occurs during the visits, and compare the behaviour of the dominant species in different strata (tree, arbustive and herbaceous). The species observed interacting with Anthracothorax nigricollis Vieillot 1817 were Phaethornis pretrei Lesson and Delattrer 1839, Thalurania furcata Gmelin 1788, and Polytmus guainumbi Pallas 1764. Nine behavioural acts grouped into four categories were identified and described. The dominant species is A. nigricollis (with 0.9 of the attacks), followed by T. furcata (with 0.07) and P. pretrei (with 0.03). The resource sharing was seen only in the shrub layer, in C. surinamensis, in which there was intraspecific and interspecific sharing. A. nigricollis showed higher interspecific toleration, T. furcata (0.27) and P. pretrei (0.55) than intraspecific A. nigricollis (0.18). The frequency of occurrence of behaviours expressed by A. nigricollis in the three vegetation strata differed significantly.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Relevância:

100.00% 100.00%

Publicador:

Resumo:

This work is devoted to Study and discuss the main methods to solve the network cost allocation problem both for generators and demands. From the presented, compared and discussed methods, the first one is based on power injections, the second deals with proportional sharing factors, the third is based upon Equivalent Bilateral Exchanges, the fourth analyzes the power How sensitivity in relation to the power injected, and the last one is based on Z(bus) network matrix. All the methods are initially illustrated using a 4-bus system. In addition, the IEEE 24-bus RTS system is presented for further comparisons and analysis. Appropriate conclusions are finally drawn. (C) 2008 Elsevier B.V. All rights reserved.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Pós-graduação em Enfermagem (mestrado profissional) - FMB

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Pós-graduação em Saúde Coletiva - FMB

Relevância:

40.00% 40.00%

Publicador:

Resumo:

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Relevância:

40.00% 40.00%

Publicador:

Resumo:

A lot sizing and scheduling problem from a foundry is considered in which key materials are produced and then transformed into many products on a single machine. A mixed integer programming (MIP) model is developed, taking into account sequence-dependent setup costs and times, and then adapted for rolling horizon use. A relax-and-fix (RF) solution heuristic is proposed and computationally tested against a high-performance MIP solver. Three variants of local search are also developed to improve the RF method and tested. Finally the solutions are compared with those currently practiced at the foundry.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Relevância:

40.00% 40.00%

Publicador:

Resumo:

This paper studies the use of different population structures in a Genetic Algorithm (GA) applied to lot sizing and scheduling problems. The population approaches are divided into two types: single-population and multi-population. The first type has a non-structured single population. The multi-population type presents non-structured and structured populations organized in binary and ternary trees. Each population approach is tested on lot sizing and scheduling problems found in soft drink companies. These problems have two interdependent levels with decisions concerning raw material storage and soft drink bottling. The challenge is to simultaneously determine the lot sizing and scheduling of raw materials in tanks and products in lines. Computational results are reported allowing determining the better population structure for the set of problem instances evaluated. Copyright 2008 ACM.