Beam Search Algorithms for Minimizing Tool Switches on a Flexible Manufacturing System

In the minimization of tool switches problem we seek a sequence to process a set of jobs so that the number of tool switches required is minimized. In this work different variations of a heuristic based on partial ordered job sequences are implemented and evaluated. All variations adopt a depth first strategy of the enumeration tree. The computational test results indicate that good results can be obtained by a variation which keeps the best three branches at each node of the enumeration tree, and randomly choose, among all active nodes, the next node to branch when backtracking.

The minimization of open stacks problem: A review of some properties and their use in pre-processing operations

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

Um algoritmo enumerativo baseado em ordenamento parcial para resolução do problema de minimização de trocas de ferramentas

No problema de minimização de troca de ferramentas procura-se por uma sequência para processar um conjunto de tarefas de modo que o número requerido de trocas de ferramentas seja o menor possível. Neste trabalho propõe-se um algoritmo para resolver este problema baseado em um ordenamento parcial das tarefas. Uma sequência ótima é obtida expandindo-se as sequências parciais enumeradas. Testes computacionais são apresentados.

Uma nova heurística para o problema de minimização de trocas de ferramentas

O problema de minimização de troca de ferramentas (MTSP) busca uma sequência de processamento de um conjunto de tarefas, de modo a minimizar o número de trocas de ferramentas requeridas. Este trabalho apresenta uma nova heurística para o MTSP, capaz de produzir bons limitantes superiores para um algoritmo enumerativo. Esta heurística possui duas fases: uma fase construtiva que é baseada em um grafo em que os vértices correspondem a ferramentas e existe um arco k = (i, j) que liga os vértices i e j se e somente se as ferramentas i e j são necessárias para a execução de alguma tarefa k; e uma fase de refinamento baseada na meta-heurística Busca Local Iterativa. Resultados computacionais mostram que a heurística proposta tem um bom desempenho para os problemas testados, contribuindo para uma redução significativa no número de nós gerados de um algoritmo enumerativo.

Minimization of open orders using interval graphs

In this paper we address an order processing optimization problem known as the Minimization of Open Stacks Problem (MOSP). This problem consists in finding the best sequence for manufacturing the different products required by costumers, in a setting where only one product can be made at a time. The objective is to minimize the maximum number of incomplete orders from costumers that are being processed simultaneously. We present an integer programming model, based on the existence of a perfect elimination order in interval graphs, which finds an optimal sequence for the costumers orders. Among other economic advantages, manufacturing the products in this optimal sequence reduces the amount of space needed to store incomplete orders.

Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date

This paper addresses the minimization of the mean absolute deviation from a common due date in a two-machine flowshop scheduling problem. We present heuristics that use an algorithm, based on proposed properties, which obtains an optimal schedule fora given job sequence. A new set of benchmark problems is presented with the purpose of evaluating the heuristics. Computational experiments show that the developed heuristics outperform results found in the literature for problems up to 500 jobs. (C) 2007 Elsevier Ltd. All rights reserved.

Minimization of the experimental workload for the prediction of pollutants propagation in rivers. Mathematical modelling and knowledge re-use

The present thesis in focused on the minimization of experimental efforts for the prediction of pollutant propagation in rivers by mathematical modelling and knowledge re-use. Mathematical modelling is based on the well known advection-dispersion equation, while the knowledge re-use approach employs the methods of case based reasoning, graphical analysis and text mining. The thesis contribution to the pollutant transport research field consists of: (1) analytical and numerical models for pollutant transport prediction; (2) two novel techniques which enable the use of variable parameters along rivers in analytical models; (3) models for the estimation of pollutant transport characteristic parameters (velocity, dispersion coefficient and nutrient transformation rates) as functions of water flow, channel characteristics and/or seasonality; (4) the graphical analysis method to be used for the identification of pollution sources along rivers; (5) a case based reasoning tool for the identification of crucial information related to the pollutant transport modelling; (6) and the application of a software tool for the reuse of information during pollutants transport modelling research. These support tools are applicable in the water quality research field and in practice as well, as they can be involved in multiple activities. The models are capable of predicting pollutant propagation along rivers in case of both ordinary pollution and accidents. They can also be applied for other similar rivers in modelling of pollutant transport in rivers with low availability of experimental data concerning concentration. This is because models for parameter estimation developed in the present thesis enable the calculation of transport characteristic parameters as functions of river hydraulic parameters and/or seasonality. The similarity between rivers is assessed using case based reasoning tools, and additional necessary information can be identified by using the software for the information reuse. Such systems represent support for users and open up possibilities for new modelling methods, monitoring facilities and for better river water quality management tools. They are useful also for the estimation of environmental impact of possible technological changes and can be applied in the pre-design stage or/and in the practical use of processes as well.

Simulation of Steady-State Nonlinear Heat Transfer Problems Through the Minimization of Quadratic Functionals

In this work it is presented a systematic procedure for constructing the solution of a large class of nonlinear conduction heat transfer problems through the minimization of quadratic functionals like the ones usually employed for linear descriptions. The proposed procedure gives rise to an efficient and easy way for carrying out numerical simulations of nonlinear heat transfer problems by means of finite elements. To illustrate the procedure a particular problem is simulated by means of a finite element approximation.

Minimization of stock weight during close-die forging of a spindle

In this paper, Finite Element method and full-scale experiments have been used to study a hot forging method for fabri-cation of a spindle using reduced initial stock size. The forging sequence is carried out in two stages. In the first stage, the hot rolled cylindrical billet is pre-formed and pierced in a closed die using a spherical nosed punch to within 20 mm of its base. This process of piercing or impact extrusion leads to high strains within the work piece but requires high press loads. In the second stage, the resulting cylinder is placed in a die with a flange chamber and upset forged to form a flange. The stock mass is optimized for complete die filling. Process parameters such as effective strain distribution, material flow and forging load in different stages of the process are analyzed. It is concluded from the simulations that minor modifications of piercing punch geometry to reduce contact between the punch and emerging vertical walls of the cylinder appreciably reduces the piercing load. In the flange chamber, a die surfaces angle of 52° instead of 45° is pro-posed to ensure effective material flow and exert sufficient tool pressure to achieve complete cavity filling. In order to achieve better compression, it is also proposed to shorten both the length of the inserted punch and the die “tongues” by a few mm.

GREEN MACHINING ORIENTED TO DIMINISH DENSITY GRADIENT FOR MINIMIZATION of DISTORTION IN ADVANCED CERAMICS

After sintering advanced ceramics, there are invariably distortions, caused in large part by the heterogeneous distribution of density gradients along the compacted piece. To correct distortions, machining is generally used to manufacture pieces within dimensional and geometric tolerances. Hence, narrow material removal limit conditions are applied, which minimize the generation of damage. Another alternative is machining the compacted piece before sintering, called the green ceramic stage, which allows machining without damage to mechanical strength. Since the greatest concentration of density gradients is located in the outer-most layers of the compacted piece, this study investigated the removal of different allowance values by means of green machining. The output variables are distortion after sintering, tool wear, cutting force, and the surface roughness of the green ceramics and the sintered ones. The following results have been noted: less distortion is verified in the sintered piece after 1mm allowance removal; and the higher the tool wear the worse the surface roughness of both green and sintered pieces.

Optimized allocation of sectionalizing switches and control and protection devices for reliability indices improvement in distribution systems

Reliability of power supply is related, among other factors, to the control and protection devices allocation in feeders of distribution systems. In this way, optimized allocation of sectionalizing switches and protection devices in strategic points of distribution circuits, improves the quality of power supply and the system reliability indices. In this work, it is presented a mixed integer non-linear programming (MINLP) model, with real and binary variables, for the sectionalizing switches and protection devices allocation problem, in strategic sectors, aimed at improving reliability indices, increasing the utilities billing and fulfilling exigencies of regulatory agencies for the power supply. Optimized allocation of protection devices and switches for restoration, allows that those faulted sectors of the system can be isolated and repaired, re-managing loads of the analyzed feeder into the set of neighbor feeders. Proposed solution technique is a Genetic Algorithm (GA) developed exploiting the physical characteristics of the problem. Results obtained through simulations for a real-life circuit, are presented. © 2004 IEEE.

GREEN MACHINING ORIENTED TO DIMINISH DENSITY GRADIENT FOR MINIMIZATION OF DISTORTION IN ADVANCED CERAMICS

After sintering advanced ceramics, there are invariably distortions, caused in large part by the heterogeneous distribution of density gradients along the compacted piece. To correct distortions, machining is generally used to manufacture pieces within dimensional and geometric tolerances. Hence, narrow material removal limit conditions are applied, which minimize the generation of damage. Another alternative is machining the compacted piece before sintering, called the green ceramic stage, which allows machining without damage to mechanical strength. Since the greatest concentration of density gradients is located in the outer-most layers of the compacted piece, this study investigated the removal of different allowance values by means of green machining. The output variables are distortion after sintering, tool wear, cutting force, and the surface roughness of the green ceramics and the sintered ones. The following results have been noted: less distortion is verified in the sintered piece after 1mm allowance removal; and the higher the tool wear the worse the surface roughness of both green and sintered pieces.

Estimation of tool pose based on force-density correlation during robotic drilling

The application of image-guided systems with or without support by surgical robots relies on the accuracy of the navigation process, including patient-to-image registration. The surgeon must carry out the procedure based on the information provided by the navigation system, usually without being able to verify its correctness beyond visual inspection. Misleading surrogate parameters such as the fiducial registration error are often used to describe the success of the registration process, while a lack of methods describing the effects of navigation errors, such as those caused by tracking or calibration, may prevent the application of image guidance in certain accuracy-critical interventions. During minimally invasive mastoidectomy for cochlear implantation, a direct tunnel is drilled from the outside of the mastoid to a target on the cochlea based on registration using landmarks solely on the surface of the skull. Using this methodology, it is impossible to detect if the drill is advancing in the correct direction and that injury of the facial nerve will be avoided. To overcome this problem, a tool localization method based on drilling process information is proposed. The algorithm estimates the pose of a robot-guided surgical tool during a drilling task based on the correlation of the observed axial drilling force and the heterogeneous bone density in the mastoid extracted from 3-D image data. We present here one possible implementation of this method tested on ten tunnels drilled into three human cadaver specimens where an average tool localization accuracy of 0.29 mm was observed.

Modified Team-based Learning (TBL) as a tool in Problem-based learning (PBL); Observations and Lessons from Year One

Both TBL and PBL attempt to maximally engage the learner and both are designed to encourage interactive teaching / learning. PBL is student centered. TBL, in contrast, is typically instructor centered. The PBL Executive Committee of the UTHSC-Houston Medical School, in an attempt to capture the pedagogical advantages of PBL and of TBL, implemented a unique PBL experience into the ICE/PBL course during the final block of PBL instruction in year 2. PBL cases provided the content knowledge for focused learning. The subsequent, related TBL exercises fostered integration / critical thinking about each of these cases. [See PDF for complete abstract]

Positive solutions of a Neumann problem with competing critical nonlinearities

We present existence results for a Neumann problem involving critical Sobolev nonlinearities both on the right hand side of the equation and at the boundary condition.. Positive solutions are obtained through constrained minimization on the Nehari manifold. Our approach is based on the concentration 'compactness principle of P. L. Lions and M. Struwe.