O Sistema Brasileiro de Identificação e Certificação de Origem Bovina e Bubalina, o SISBOV, completou no início de 2006 quatro anos de existência. Criado principalmente como uma resposta às exigências européias, o SISBOV já passou por uma... more
O Sistema Brasileiro de Identificação e Certificação de Origem Bovina e Bubalina, o SISBOV, completou no início de 2006 quatro anos de existência. Criado principalmente como uma resposta às exigências européias, o SISBOV já passou por uma série de ajustes e modificações em sua estrutura de funcionamento. A partir da análise de estudos de caso envolvendo bovinocultores de corte e leite, bubalinocultores, frigoríficos e empresas de comércio varejista, o presente trabalho tece um panorama sobre a implementação da rastreabilidade na produção brasileira de bovinos, verificando, por exemplo, que o sistema ainda apresenta problemas, sendo pouco adotado por médios e pequenos produtores, principalmente da atividade leiteira. O resultado da pesquisa ressalta ainda que a rastreabilidade e a certificação de origem são usadas com pelo menos cinco propósitos diferentes : como requisitos à exportação, como ferramentas para melhoria da qualidade do produto, como estratégias de diferenciação do prod...
Research Interests:
Research Interests:
"A heuristic algorithm is presented for locating and dimensioning warehouses which is sufficiently flexible to incorporate the variability and particularities of developing countries, including capacity constraints. The... more
"A heuristic algorithm is presented for locating and dimensioning warehouses which is sufficiently flexible to incorporate the variability and particularities of developing countries, including capacity constraints. The goal is to minimize warehousing and transportation costs. To attain this objective we use an out-of-kilter algorithm determining the flow with minimum total cost. As we consider economies of scale, unit costs at each arc are a function of the flows, i.e. the problem is actually non-linear. To establish the values of unit costs we use an iterative procedure. The method converges but not necessarily to a global optimum, so that a sub-routine called DROP is used as a second part of the heuristic procedure. "
Research Interests:
... Claudio Thomas Bornstein Corresponding Author Contact Information , E-mail The Corresponding Author , a and Hugo Bravo Azlan b. ... Later Van Roy, 1986 and Akinc and Khumawala, 1977 extended some of these results for the capacitated... more
... Claudio Thomas Bornstein Corresponding Author Contact Information , E-mail The Corresponding Author , a and Hugo Bravo Azlan b. ... Later Van Roy, 1986 and Akinc and Khumawala, 1977 extended some of these results for the capacitated warehouse location problem using a ...
Research Interests:
Research Interests:
Research Interests: Information Systems, Marketing, Computer Science, Information Technology, Project Management, and 15 moreCombinatorial Optimization, Operations Research, Production, Logistics, Management Science, Forecasting, Scheduling, Operational Research, Investment, Mathematical Sciences, Reliability, Dominance, Location, Communications Technology, and Location Problem
... como se deu o processo de criação do Sistema Bra-sileiro de Identificação e Certificação de Origem Bovina e Buba-lina abriremos esta ... Todas estas crises fizeram ressaltar a falta de um controle sani-tário e de mecanismos de... more
... como se deu o processo de criação do Sistema Bra-sileiro de Identificação e Certificação de Origem Bovina e Buba-lina abriremos esta ... Todas estas crises fizeram ressaltar a falta de um controle sani-tário e de mecanismos de segurança alimentar mais eficazes, provocando ...
Research Interests: Philosophy and Humanities
AbstractThe capacitated plant location problem with linear transportation costs is considered. An algorithm based on ADD/DROP procedures is proposed. Exact rules are presented allowing an a priori opening or closing of facilities.... more
AbstractThe capacitated plant location problem with linear transportation costs is considered. An algorithm based on ADD/DROP procedures is proposed. Exact rules are presented allowing an a priori opening or closing of facilities. Facilities left are submitted to an extension of the exact rules. Procedures are implemented with the help of lower and upper bounds using Lagrangean relaxation. Computational results are
Research Interests:
The process of software deployment into an organization is a complex process that encompasses various aspects. Studies on the impact of software systems deployment in the customer’s environment in the medium and long terms are hardly... more
The process of software deployment into an organization is a complex process that encompasses various aspects. Studies on the impact of software systems deployment in the customer’s environment in the medium and long terms are hardly found, specially when the deployment of the software product and the introduction of data processing into the organization happen at the same time. Nevertheless
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
ABSTRACT The paper examines the problems faced in trying to find the optimal location and dimension of warehouses for grain storage in a co-operative in the south of Brazil. Implicit in the study was the decision between large centrally... more
ABSTRACT The paper examines the problems faced in trying to find the optimal location and dimension of warehouses for grain storage in a co-operative in the south of Brazil. Implicit in the study was the decision between large centrally located warehouses and a network of small decentralized silos. Here we examine the political and social factors which were involved in the study and which led to a complete reformulation of the initial problem.
Research Interests:
If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. In case of further problems read the IDEAS help ...
Research Interests:
Research Interests:
AbstractSome special cases of the Maximum Flow Problem under nonnegative lower bounds on arc flows are investigated. Assuming that at least one of these bounds is strictly positive, a class of problems has been identified for which a... more
AbstractSome special cases of the Maximum Flow Problem under nonnegative lower bounds on arc flows are investigated. Assuming that at least one of these bounds is strictly positive, a class of problems has been identified for which a single phase algorithm suffices to prove optimality. This situation contrasts with the two phases algorithm which is commonly used in the literature