Modelagem do problema integrado de dimensionamento de lotes e corte de estoque em indústria moveleira

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

Heurísticas para o problema de dimensionamento de lotes capacitado com custo de transporte

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

Formulações fortes para o problema de dimensionamento de lotes com várias plantas

This paper considers the multi-plant lot sizing problem. Each item can be produced in any plant and it is possible to meet the demand of a particular plant with production from one (or several) other plants, in this case, incurs a transfer cost. The objective is todevelop strong formulations for this problem. Reformulations that based on the shortest path problem and facility location problem are investigated. Finally, some computational results are presented comparing all the proposed formulations.

Relaxação Lagrangiana Aplicada ao Problema de Dimensionamento de Lotes em Máquinas Paralelas: Limitantes Inferiores

This paper addresses the single stage lot-sizing problem in parallel machines. Each item can be produced on any machine, and incurs a setup time before to start the production. The objective of this paper is to obtain lower bounds of good quality for this problem. A solution method is developed based on a reformulation of the problem and the Lagrangian relaxation of a set of constraints. Some computational results are presented comparing the proposed method with a method from the literature and with a computational package.

Modelos Matemáticos e Métodos de Solução para Problemas de Dimensionamento de Lotes

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

Germination, vigor and pathogen incidence in broccoli seeds treated with Carboxin + Thiram

The purpose of treating seeds chemically is to eradicate their pathogens and/or protect them against soil pathogens, mainly by germination time. However, there is little research on vegetables investigating the effect of this treatment on seed quality. Therefore, this study evaluates the effects of Carboxin + Thiram doses on germination and vigor of three lots of broccoli seeds, as well as on the incidence of fungi in treated seed. The 15 treatments were evaluated in a factorial system (3x5), with the first factor consisting of three lots of 'Avenger' broccoli seeds (lots 82744, 82745 and 82749), and the second factor consisting of five doses (0, 0.04, 0.06, 0.10 and 0.12% of a.i.) of Carboxin + Thiram fungicide (commercial name Vitavax-Thiran). The germination and seed vigor were evaluated, in addition to the presence of pathogens in seeds after treatment (blotter test). All lots showed high levels of germination and vigor. The lot 82749, however, showed higher value in plug test in substrate emergence (99%) than lot 82745 (95%). Regarding the treatment with Carboxin + Thiram, no changes in germination average (98%) and vigor were noticed (average for the first germination count, length, and dry weight of seedling, plug test at 10 days after sowing of 97%, 4.9 cm, 4.0 mg and 96%, respectively), showing that this fungicide, in the evaluated doses, does not affect the quality of broccoli seeds. As to seeds health, the pathogens Alternaria spp. and Fusarium spp. were detected, in addition to saprophytic species such as Penicillium, Aspergillus, Trichoderma, and Rhizopus. The higher incidence of Fusarium spp. was noticed in lot 82744, and the lowest in lot 82749. As to Penicillium spp., lot 82479 was the most contaminated. Regarding other fungi, the general incidence was very low and there was no difference between lots and doses used.

A knapsack problem as a tool to solve the production planning problem in small foundries

According to recent research carried out in the foundry sector, one of the most important concerns of the industries is to improve their production planning. A foundry production plan involves two dependent stages: (1) determining the alloys to be merged and (2) determining the lots that will be produced. The purpose of this study is to draw up plans of minimum production cost for the lot-sizing problem for small foundries. As suggested in the literature, the proposed heuristic addresses the problem stages in a hierarchical way. Firstly, the alloys are determined and, subsequently, the items that are produced from them. In this study, a knapsack problem as a tool to determine the items to be produced from furnace loading was proposed. Moreover, we proposed a genetic algorithm to explore some possible sets of alloys and to determine the production planning for a small foundry. Our method attempts to overcome the difficulties in finding good production planning presented by the method proposed in the literature. The computational experiments show that the proposed methods presented better results than the literature. Furthermore, the proposed methods do not need commercial software, which is favorable for small foundries. (C) 2010 Elsevier Ltd. All rights reserved.

Accessibility and demand at an Emergency Care Unit: the user's perspective

AIM: To analyze the search for Emergency Care (EC) in the Western Health District of Ribeirão Preto (São Paulo), in order to identify the reasons why users turn to these services in situations that are not characterized as urgencies and emergencies. METHODS: A qualitative and descriptive study was undertaken. A guiding script was applied to 23 EC users, addressing questions related to health service accessibility and welcoming, problem solving, reason to visit the EC and care comprehensiveness. RESULTS: The subjects reported that, at the Primary Health Care services, receiving care and scheduling consultations took a long time and that the opening hours of these services coincide with their work hours. At the EC service, access to technologies and medicines was easier. CONCLUSION: Primary health care services have been unable to turn into the entry door to the health system, being replaced by emergency services, putting a significant strain on these services' capacity.

Combinatorial and Robust Optimisation Models and Algorithms for Railway Applications

This thesis deals with an investigation of combinatorial and robust optimisation models to solve railway problems. Railway applications represent a challenging area for operations research. In fact, most problems in this context can be modelled as combinatorial optimisation problems, in which the number of feasible solutions is finite. Yet, despite the astonishing success in the field of combinatorial optimisation, the current state of algorithmic research faces severe difficulties with highly-complex and data-intensive applications such as those dealing with optimisation issues in large-scale transportation networks. One of the main issues concerns imperfect information. The idea of Robust Optimisation, as a way to represent and handle mathematically systems with not precisely known data, dates back to 1970s. Unfortunately, none of those techniques proved to be successfully applicable in one of the most complex and largest in scale (transportation) settings: that of railway systems. Railway optimisation deals with planning and scheduling problems over several time horizons. Disturbances are inevitable and severely affect the planning process. Here we focus on two compelling aspects of planning: robust planning and online (real-time) planning.

Cost Sharing under Uncertainty: An Algorithmic Approach to Cooperative Interval-Valued Games

Recently, Branzei, Dimitrov, and Tijs (2003) introduced cooperative interval-valued games. Among other insights, the notion of an interval core has been coined and proposed as a solution concept for interval-valued games. In this paper we will present a general mathematical programming algorithm which can be applied to find an element in the interval core. As an example, we discuss lot sizing with uncertain demand to provide an application for interval-valued games and to demonstrate how interval core elements can be computed. Also, we reveal that pitfalls exist if interval core elements are computed in a straightforward manner by considering the interval borders separately.

A Column-Generation Approach for a Short-Term Production Planning Problem in Closed-Loop Supply Chains

We present a new model formulation for a multi-product lot-sizing problem with product returns and remanufacturing subject to a capacity constraint. The given external demand of the products has to be satisfied by remanufactured or newly produced goods. The objective is to determine a feasible production plan, which minimizes production, holding, and setup costs. As the LP relaxation of a model formulation based on the well-known CLSP leads to very poor lower bounds, we propose a column-generation approach to determine tighter bounds. The lower bound obtained by column generation can be easily transferred into a feasible solution by a truncated branch-and-bound approach using CPLEX. The results of an extensive numerical study show the high solution quality of the proposed solution approach.