Generating unconstrained two-dimensional non-guillotine cutting patterns by a Recursive Partitioning Algorithm

In this study, a dynamic programming approach to deal with the unconstrained two-dimensional non-guillotine cutting problem is presented. The method extends the recently introduced recursive partitioning approach for the manufacturer's pallet loading problem. The approach involves two phases and uses bounds based on unconstrained two-staged and non-staged guillotine cutting. The method is able to find the optimal cutting pattern of a large number of pro blem instances of moderate sizes known in the literature and a counterexample for which the approach fails to find known optimal solutions was not found. For the instances that the required computer runtime is excessive, the approach is combined with simple heuristics to reduce its running time. Detailed numerical experiments show the reliability of the method. Journal of the Operational Research Society (2012) 63, 183-200. doi: 10.1057/jors.2011.6 Published online 17 August 2011

Contribuições para o problema de corte de estoque bidimensional na indústria moveleira

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

Evaluation of cutting patterns produced in primary teeth by an air-abrasion system

Objective: the aim of this in vitro study was to assess the effect of tip diameter, nozzle distance, and application time of an air-abrasion system for cavity preparation on the enamel of primary teeth. Method and materials: Forty exfoliated primary teeth were air abraded with a microabrasion machine used with a handpiece with an 80-degree-angle nozzle, 50-mum abrasive particle size, and 80-psi air pressure. The effects of 0.38- or 0.48-mm inner tip diameter, 2- or 5-mm distance from tip to tooth surface, and 15 or 30 seconds of application time on cutting efficiency were evaluated. Cutting width and depth were analyzed and measured from scanning electron micrographs. Results: Statistical analysis revealed that the width of the cuts was significantly greater when the tip distance was increased. Significantly deeper cavities were produced by a tip with a 0.48-mm inner diameter. The application time did not influence the cuts. Conclusion: the cutting patterns found in this study suggest that precise removal of enamel in primary teeth is best accomplished when a tip with a 0.38-mm inner diameter is used at a 2-mm distance.

Evaluation of cutting patterns produced with air-abrasion systems using different tip designs.

This study assessed cavity preparations produced with different air abrasion tip parameters. Twelve test groups of extracted teeth were prepared to evaluate the parameters of 80 degrees or 45 degrees nozzle angles and 0.38 or 0.48 mm inner tip diameters. All other factors were held constant. A device was made to hold the specimen and air abrasion handpiece that standardized the distance and position relative to the tooth and time of application. The cavities were evaluated by assessing the rounding of the cavosurface margins and cavity floor. Measurements of cavosurface angles and the angle of concavity were made at the deepest portion of the abraded surface using scanning electron micrographs. The cavosurface angles were compared using paired t-test, and the effects of the tip design parameters were analyzed by ANOVA and Duncan's Multiple Range test. From the cavity patterns found in this study, the authors suggest that 80 degrees angle tips are more appropriate than 45 degrees angle tips for making narrow, deep cuts for preventive resin restorations. Conversely, when shallow preparations are needed, as in the case of Class V cavity preparations, cutting patterns of 45 degrees angle tips are more suitable.

A characteristics study on the performance of a 2-stage light gas gun

In order to obtain an overall and systematic understanding of the performance of a two-stage light gas gun (TLGG), a numerical code to simulate the process occurring in a gun shot is advanced based on the quasi-one-dimensional unsteady equations of motion with the real gas effect,;friction and heat transfer taken into account in a characteristic formulation for both driver and propellant gas. Comparisons of projectile velocities and projectile pressures along the barrel with experimental results from JET (Joint European Tons) and with computational data got by the Lagrangian method indicate that this code can provide results with good accuracy over a wide range of gun geometry and loading conditions.

Optimization of 2-stage gas gun for fusion refueling pellet injection with consideration of real effects

Analytic expression of pellet acceleration by constant base pressure with consideration of gas-wall friction, heat transfer and viscous dissipation that important for high speed injection is obtained. The process of compression stage is formulated by a set of governing equations and can be numerically integrated. Excellent confirmation with experiments is obtained and the ways to optimum match the compression stage with the launch stage are suggested.

Valorization of scrap tires pyrolysis oil (STPO) through a 2-stage hydrotreating-hydrocracking strategy. Process variables and kinetic modeling

232 p.

Simulation of 2-D metal cutting by means of a distributed algorithm

Temperature distributions involved in some metal-cutting or surface-milling processes may be obtained by solving a non-linear inverse problem. A two-level concept on parallelism is introduced to compute such temperature distribution. The primary level is based on a problem-partitioning concept driven by the nature and properties of the non-linear inverse problem. Such partitioning results to a coarse-grained parallel algorithm. A simplified 2-D metal-cutting process is used as an example to illustrate the concept. A secondary level exploitation of further parallel properties based on the concept of domain-data parallelism is explained and implemented using MPI. Some experiments were performed on a network of loosely coupled machines consist of SUN Sparc Classic workstations and a network of tightly coupled processors, namely the Origin 2000.

Sequencing cutting patterns with colored interval graphs

The problem addressed here originates in the industry of flat glass cutting and wood panel sawing, where smaller items are cut from larger items accordingly to predefined cutting patterns. In this type of industry the smaller pieces that are cut from the patterns are piled around the machine in stacks according to the size of the pieces, which are moved to the warehouse only when all items of the same size have been cut. If the cutting machine can process only one pattern at a time, and the workspace is limited, it is desirable to set the sequence in which the cutting patterns are processed in a way to minimize the maximum number of open stacks around the machine. This problem is known in literature as the minimization of open stacks (MOSP). To find the best sequence of the cutting patterns, we propose an integer programming model, based on interval graphs, that searches for an appropriate edge completion of the given graph of the problem, while defining a suitable coloring of its vertices.

Cost-effectiveness analysis of a 2-stage community-based hepatocellular carcinoma screening program in Taiwan

Hepatocellular carcinoma (HCC) has been ranked as the top cause of death due to neoplasm malignancy in Taiwan for years. The high incidence of HCC in Taiwan is primarily attributed to high prevalence of hepatitis viral infection. Screening the subjects with liver cirrhosis for HCC was widely recommended by many previous studies. The latest practice guideline for management of HCC released by the American Association for the Study of Liver Disease (AASLD) in 2005 recommended that the high risk groups, including cirrhotic patients, chronic HBV/HCV carriers, and subjects with family history of HCC and etc., should undergo surveillance.^ This study aims to investigate (1) whether the HCC screening program can prolong survival period of the high risk group, (2) what is the incremental cost-effectiveness ratio of the HCC screening program in Taiwan, as compared with a non-screening strategy from the payer perspective, (3) which high risk group has the lowest ICER for the HCC screening program from the insurer's perspective, in comparison with no screening strategy of each group, and (4) the estimated total cost of providing the HCC screening program to all high risk groups.^ The high risk subjects in the study were identified from the communities with high prevalence of hepatitis viral infection and classified into three groups (cirrhosis group, early cirrhosis group, and no cirrhosis group) at different levels of risk to HCC by status of liver disease at the time of enrollment. The repeated ultrasound screenings at an interval of 3, 6, and 12 months were applied to cirrhosis group, early cirrhosis group, and no cirrhosis group, respectively. The Markov-based decision model was constructed to simulate progression of HCC and to estimate the ICER for each group of subjects.^ The screening group had longer survival in the statistical results and the model outcomes. Owing to the low HCC incidence rate in the community-based screening program, screening services only have limited effect on survival of the screening group. The incremental cost-effectiveness ratio of the HCC screening program was $3834 per year of life saved, in comparison with the non-screening strategy. The estimated total cost of each group from the screening model over 13.5 years approximately consumes 0.13%, 1.06%, and 0.71% of total amount of adjusted National Health Expenditure from Jan 1992 to Jun 2005. ^ The subjects at high risk of developing HCC to undergo repeated ultrasound screenings had longer survival than those without screening, but screening was not the only factor to cause longer survival in the screening group. The incremental cost-effectiveness ratio of the 2-stage community-based HCC screening program in Taiwan was small. The HCC screening program was worthy of investment in Taiwan. In comparison with early cirrhosis group and no cirrhosis group, cirrhosis group has the lowest ICER when the screening period is less than 19 years. The estimated total cost of providing the HCC screening program to all high risk groups consumes approximately 1.90% of total amount of adjusted 13.5-year NHE in Taiwan.^

Operator, organizational, direct support, and general support maintenance manual : compressor, power driven rotary 2 stage, 250 cfm, 100 psi, 4 cylinder, 2 cycle, DED, trailer mtd, 2 wheel (Ingersoll-Rand Co. model RMS-250), FSN 4310-471-3075.

"July 1972."

Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation

We investigate several two-dimensional guillotine cutting stock problems and their variants in which orthogonal rotations are allowed. We first present two dynamic programming based algorithms for the Rectangular Knapsack (RK) problem and its variants in which the patterns must be staged. The first algorithm solves the recurrence formula proposed by Beasley; the second algorithm - for staged patterns - also uses a recurrence formula. We show that if the items are not so small compared to the dimensions of the bin, then these algorithms require polynomial time. Using these algorithms we solved all instances of the RK problem found at the OR-LIBRARY, including one for which no optimal solution was known. We also consider the Two-dimensional Cutting Stock problem. We present a column generation based algorithm for this problem that uses the first algorithm above mentioned to generate the columns. We propose two strategies to tackle the residual instances. We also investigate a variant of this problem where the bins have different sizes. At last, we study the Two-dimensional Strip Packing problem. We also present a column generation based algorithm for this problem that uses the second algorithm above mentioned where staged patterns are imposed. In this case we solve instances for two-, three- and four-staged patterns. We report on some computational experiments with the various algorithms we propose in this paper. The results indicate that these algorithms seem to be suitable for solving real-world instances. We give a detailed description (a pseudo-code) of all the algorithms presented here, so that the reader may easily implement these algorithms. (c) 2007 Elsevier B.V. All rights reserved.