Hydrophobic Cross-Linked Poly(dimethylsiloxane)-Based Sorbents for Oil Spill Applications

With the increase of industrialization and urbanization, humankind faces massive oil-based pollution due to tanker accidents, human error, and natural disasters. For this, hydrophobic sorbents are fabricated and their applications for the removal of oil from polluted water sources are investigated. These hydrophobic sorbents are prepared by the condensation reaction of poly(dimethylsiloxane) and tris[3-(trimethoxysilyl)propyl]isocyanurate cross-linker via bulk polymerization. The obtained sorbents exhibit high oil sorption capacity, fast absorption–desorption kinetics, and great reusability. Moreover, they can selectively absorb oil from the water surface, thus making them practical for water clean-up applications.     

Multiobjective evaluation of advanced manufacturing system technology investments with risk

Advanced manufacturing system technologies are difficult to evaluate using ordinary financial measures owing to the presence of risk and significant intangible factors. In this paper a methodology is proposed that quantifies financial, strategic, and tactical attributes of each alternative. Attribute values are denned for each period of project life. Both project life and attributes are treated as random variables. Attributes are discounted to the current time and the multiple objectives are combined by composite programming. The distribution of the combined objective is estimated. The procedure is demonstrated on an actual case study.     

Tool addition strategies for flexible manufacturing systems

The allocation of tools to machines determines potential part routes in flexible manufacturing systems. Given production requirements and a minimum feasible set of tools, the decision of how to fill vacant slots in tool magazines to maximize routing flexibility is shown to be a minimum cost network flow problem for the cases when routing flexibility is a function of the average workload per tool aggregated over tool types, or of the number of possible routes through the system. A linear programming model is then used to plan a set of routes for each part type so as to minimize either the material handling requirement or the maximum workload on any machine. The impact of these tool addition strategies on the material handling and workload equalization is investigated and computational results presented. The advantage of the overall approach is computational simplicity at each step and the ability to react to dynamic changes.This article is based upon work supported by the National Science Foundation under Grants No. DMC 85–44993 and DDM 92–15432.This work was done by the author while visiting the SIE Department of the University of Arizona.     

Hub relay network design for daily driver routes

Hub-based relay networks for long haul trucking offer an opportunity to improve the work–life balance of drivers while simultaneously supporting faster delivery through near-continuous flow of containers from source to destination. In this paper, we develop a model for deciding hub location and sizing along with the routing of loads. Costs of hub construction and operation, transportation and penalties for multi-day driver trips are included. Both deterministic and two-stage stochastic programming models have been formulated in this paper. The goal is to determine the optimal hub and route decisions so that overall cost is minimised. A case study on the highway network for the Western United States demonstrates the computational tractability of the approach along with the importance of considering demand uncertainty.     

A methodology for designing flexible cellular manufacturing systems

Cell formation in cellular manufacturing deals with the identification of machines that can be grouped to create manufacturing cells and the identification of part families to be processed within each cell. Dynamic and random variations in part demands can negatively impact cell performance by creating unstable machine utilizations. The purpose of this paper is to introduce and illustrate an interactive cell formation method that can be used to design 'flexible' cells. Flexibility in this context refers to routing flexibility (i.e., the ability for the cellular system to process parts within multiple cells) and demand flexibility (i.e., the ability of the cell system to respond quickly to changes in part demand and part mix). Through an experimental analysis using multiple data sets, we also validate the procedure and provide guidelines for parameter settings depending upon the type of flexibility of interest to the user. Finally, trade-offs and interdependences between alternative types of flexibility in the context of cellular systems are illustrated.     

An Adaptable Problem-space-based Search Method for Flexible Flow Line Scheduling

Leon and Ramamoorthy (1997) developed an adaptable problem-space-based search method. Part of that work included development of a lower bound and comparison of makespans using real-world data. In this note we improve their lower bound and show that the Leon and Ramamoorthy search method found better makespan solutions than their lower bound indicated, including some optimal makespans.     

Formation of independent flow-line cells based on operation requirements and machine capabilities

In this paper we study the generalized grouping problem of cellular manufacturing. We propose an operation-sequence-based method for forming flow-line manufacturing cells. Process planning in the form of selection of the machine for each operation is included in the problem formulation. Input requirements include the set of operation requirements for each part type, and operation capabilities for all available machine types. The objective is to find the minimum-cost set of flow-line cells that is capable of producing the desired part mix. A similarity coefficient based on the longest common operation subsequence between part types is defined and used to group parts into independent, flow-line families. An algorithm is developed for finding a composite operation supersequence for each family. Given machine options for each operation in this sequence, the optimal machine sequence and capacity for each cell is then found by solving a shortest path problem on an augmented graph. The method is shown to be efficient and computational results are reported.     

Reliability analysis of electronic devices with multiple competing failure modes involving performance aging degradation

This paper presents an extension of reliability analysis of electronic devices with multiple competing failure modes involving performance aging degradation. The probability that a product fails on a specific mode is derived. Using this probability, the dominant failure mode on the product can be predicted. A practical example is presented to analyze an electronic device with two kinds of major failure modes–solder/Cu pad interface fracture (a catastrophic failure) and light intensity degradation (a degradation failure). Reliability modeling of an individual failure mode and device reliability analysis is presented and results are discussed. Copyright © 2003 John Wiley & Sons, Ltd.     

An Algorithm for NC Turret Punch Press Tool Location and Hit Sequencing

This article proposes a new heuristic algorithm for minimizing part programs for numerical control (NC) punch presses. The part program contains the order in which the holes are punched into the part and the assignments of the tools to the indexing turret. The problem is broken down into two classical subproblems: the traveling salesman problem (TSP) and the quadratic assignment problem (QAP). By generating a feasible solution and then alternately improving the subproblems, good solutions are obtained in reasonable time. The algorithm is described, and then empirical results are given for applying the algorithm to real and randomly generated problems.     

Localized benign pleural mesothelioma arising in a radiation field

We collected 7 Friedreich ataxia (FRDA) pedigrees from France. All cases but one family were homozygous for an unstable GAA trinucleotide expansion in the first intron of the frataxin gene. In this peculiar pedigree absence of the GAA expansion supports the notion of possible genetic heterogeneity of FRDA.