A case study in FMS production planning and dispatching

The speedy development and extensive application of computers have helped play a significant role in a new technological revolution. The importance of FMS flexibility in producing a variety of products and adapting rapidly to customer requirements makes FMSs attractive. Further, FMSs are most appropriate for largevariety and medium- to high-volume production environments. However, the module of the FMS production planning system is not perfect. This paper focuses on a new scheme for FMS production planning and dispatching under the realistic assumptions promoted by a particular flexible manufacturing factory. Some practical constraints such as fixture uniqueness, limited tool magazine capacity, and a given number of pallets are considered. The simulation results indicate that the scheme provides a good production plan, according to the short-term plans from the MIS Department. Some conclusions are drawn and a discussion is presented.     

A study of FMS part type selection approaches for short-term production planning

This research compares seven approaches from the literature to the selection of part types for simultaneous production over the next time horizon. A flexible approach to the selection of part types and the simultaneous determination of their mix ratios so as to balance aggregate machine workloads is presented. Constraints on tool magazine capacity are considered. Simulation studies are conducted on realistic, detailed models of flexible flow systems (FFSs) configured as pooled machines of equal sizes. The simulated settings are constructed to evaluate the impact of such factors as blocking, transportation, buffer utilizations, and fixture requirements and limitations of various types. One of the goals of this study is to encourage industry to relax, for those FMS types for which the procedure is appropriate, what is essentially an artificial constraint: that tool changing be isolated in time, to a period between batches. For other types of FMSs, batching may be appropriate. The results indicate that using the flexible approach enables the system to be more highly utilized. It is also observed that the batching approaches tend to require more fixtures of each type than the flexible approach. The system utilizations for the batching approaches seem to be more sensitive to restrictions on the number of fixtures of each type. Further research needs are also discussed.     

Algorithms for efficient near-perfect phylogenetic tree reconstruction in theory and practice

We consider the problem of reconstructing near-perfect phylogenetic trees using binary character states (referred to as BNPP). A perfect phylogeny assumes that every character mutates at most once in the evolutionary tree, yielding an algorithm for binary character states that is computationally efficient but not robust to imperfections in real data. A near-perfect phylogeny relaxes the perfect phylogeny assumption by allowing at most a constant number of additional mutations. We develop two algorithms for constructing optimal near-perfect phylogenies and provide empirical evidence of their performance. The first simple algorithm is fixed parameter tractable when the number of additional mutations and the number of characters that share four gametes with some other character are constants. The second, more involved algorithm for the problem is fixed parameter tractable when only the number of additional mutations is fixed. We have implemented both algorithms and shown them to be extremely efficient in practice on biologically significant data sets. This work proves the BNPP problem fixed parameter tractable and provides the first practical phylogenetic tree reconstruction algorithms that find guaranteed optimal solutions while being easily implemented and computationally feasible for data sets of biologically meaningful size and complexity.     

Algorithms for energy efficient mobile object tracking in wireless sensor networks

Wireless sensor networks have found more and more applications in a variety of pervasive computing environments, in their functions as data acquisition in pervasive applications. However, how to get better performance to support data acquisition of pervasive applications over WSNs remains to be a nontrivial and challenging task. The network lifetime and application requirement are two fundamental, yet conflicting, design objectives in wireless sensor networks for tracking mobile objects. The application requirement is often correlated to the delay time within which the application can send its sensing data back to the users in tracking networks. In this paper we study the network lifetime maximization problem and the delay time minimization problem together. To make both problems tractable, we have the assumption that each sensor node keeps working since it turns on. And we formulate the network lifetime maximization problem as maximizing the number of sensor nodes who don’t turn on, and the delay time minimization problem as minimizing the routing path length, after achieving the required tracking tasks. Since we prove the problems are NP-complete and APX-complete, we propose three heuristic algorithms to solve them. And we present several experiments to show the advantages and disadvantages referring to the network lifetime and the delay time among these three algorithms on three models, random graphs, grids and hypercubes. Furthermore, we implement the distributed version of these algorithms.     

Periodic reconfiguration of general-purpose fixtures in a dedicated FMS

Fixtures dedicated to a given part type in an FMS can sometimes become bottlenecks to some FMSs as demand variability increases. Past research indicates that the increased operating flexibility associated with general-purpose fixtures may be a key to the efficient scheduling of even those FMSs dedicated to producing a small number of part types over a known planning horizon. However, the increased time required to reconfigure general-purpose fixtures to meet current demand may also create a bottleneck in the loading area. Increases in the defect rate associated with improper fixture assembly and part alignment are also possible. One solution may be to reconfigure general-purpose fixtures off line according to specific demand schedules for the period, and then to treat them as “pseudo-dedicated” fixtures until the next period. This would utilize some of the flexibility associated with general-purpose fixtures, while reducing the negative drawbacks associated with incremental loading time and alignment errors. The research reported in this article simulates an existing FMS, using fixtures dedicated to individual part types, and compares the results to those collected using a group of general-purpose fixtures that are reconfigured each week, based on current demand for each part type, and used in a pseudo-dedicated fashion. Three simulation experiments are run with increasing coefficients of variation in the input distributions used to generate demand. Performance is measured by system throughput, proportion of parts tardy, and average tardiness. The simulation results show that while overall system performance decreases as the level of demand mix variability increases, this negative impact is significantly less severe when using pseudo-dedicated, general-purpose fixtures.     

Structure-based optimization of a potent class of arylamide FMS inhibitors

An anti-inflammatory 1,2,4-phenylenetriamine-containing series of FMS inhibitors with a potential to form reactive metabolites was transformed into a series with equivalent potency by incorporation of carbon-based replacement groups. Structure-based modeling provided the framework to efficiently effect this transformation and restore potencies to previous levels. This optimization removed a risk factor for potential idiosyncratic drug reactions.     

Algorithms for ultrasound elastography: a survey

Elastography is a useful and interesting technique that can be used to infer stiffness information from ultrasound medical images. In one decade of activity, the scientific community has developed this technique to a more and more mature stage, such that it has evolved into a fruitful application for clinical practice. During this decade, the evolution has proceeded from qualitative stiffness information to numerical quantification using different algorithms and approaches, based on both iterative and direct approaches. Moreover, different post- and pre-processing techniques as well as evaluation methods have been implemented. This work presents a survey on the methods developed by giving a short overview of algorithms and mathematical solutions and by analysing results and comparing methodologies.     

The effectiveness of mutation operation in the case of Estimation of Distribution Algorithms

The Estimation of Distribution Algorithms are a class of evolutionary algorithms which adopt probabilistic models to reproduce individuals in the next generation, instead of conventional crossover and mutation operators. In this paper, mutation operators are incorporated into Estimation of Distribution Algorithms in order to maintain the diversities in EDA populations. Two kinds of mutation operators are examined: a bitwise mutation operator and a mutation operator taking account into the probabilistic model. In experiments, we do not only compare the proposed methods with conventional EDAs on a few fitness functions but also analyze sampled probabilistic models by using KL-divergence. The experimental results shown in this paper elucidate that the mutation operator taking account into the probabilistic model improve the search ability of EDAs.     

A comparative study of FMS tool allocation and part type selection approaches for a varying part type mix

Hankins and Rovito (1984) examined the impact of different tool policies on cutting tool inventory levels and spindle utilization for a flexible manufacturing system (FMS). This study provides a broader perspective of the impact of tool allocation approaches on flow times, tardiness, percent of orders tardy, machine utilization, and robot utilization. Part type selection procedures have been suggested for the FMS prerelease planning problem. However, very little research has specifically evaluated the part type selection procedures across different tool allocation approaches. Also, with the exception of Stecke and Kim (1988, 1991) no other known study has provided any insights on what tool allocation approaches are appropriate when processing different mixes of part types. This research is devoted to addressing those issues. Three tool allocation approaches, three production scheduling rules, and three levels of part mix are evaluated in this study through a similation model of a flexible manufacturing system. The specific impacts of the tool approaches, their interaction effects with the part type selection rules, and their effectiveness at different part type mix levels are provided through the use of a regression metamodel.     

Loop prediction for a GPCR homology model: Algorithms and results

We present loop structure prediction results of the intracellular and extracellular loops of four G‐protein‐coupled receptors (GPCRs): bovine rhodopsin (bRh), the turkey β1‐adrenergic (β1Ar), the human β2‐adrenergic (β2Ar) and the human A2a adenosine receptor (A2Ar) in perturbed environments. We used the protein local optimization program, which builds thousands of loop candidates by sampling rotamer states of the loops' constituent amino acids. The candidate loops are discriminated between with our physics‐based, all‐atom energy function, which is based on the OPLS force field with implicit solvent and several correction terms. For relevant cases, explicit membrane molecules are included to simulate the effect of the membrane on loop structure. We also discuss a new sampling algorithm that divides phase space into different regions, allowing more thorough sampling of long loops that greatly improves results. In the first half of the paper, loop prediction is done with the GPCRs' transmembrane domains fixed in their crystallographic positions, while the loops are built one‐by‐one. Side chains near the loops are also in non‐native conformations. The second half describes a full homology model of β2Ar using β1Ar as a template. No information about the crystal structure of β2Ar was used to build this homology model. We are able to capture the architecture of short loops and the very long second extracellular loop, which is key for ligand binding. We believe this the first successful example of an RMSD validated, physics‐based loop prediction in the context of a GPCR homology model. Proteins 2013. © 2012 Wiley Periodicals, Inc.     

Enhancement of kinase selectivity in a potent class of arylamide FMS inhibitors

Structure–activity relationship (SAR) studies on a highly potent series of arylamide FMS inhibitors were carried out with the aim of improving FMS kinase selectivity, particularly over KIT. Potent compound 17r (FMS IC₅₀ 0.7 nM, FMS cell IC₅₀ 6.1 nM) was discovered that had good PK properties and a greater than fivefold improvement in selectivity for FMS over KIT kinase in a cellular assay relative to the previously reported clinical candidate 4. This improved selectivity was manifested in vivo by no observed decrease in circulating reticulocytes, a measure of bone safety, at the highest studied dose. Compound 17r was highly active in a mouse pharmacodynamic model and demonstrated disease-modifying effects in a dose-dependent manner in a strep cell wall-induced arthritis model of rheumatoid arthritis in rats.     

An easy-to-use tool for planning and modeling a calorimetric titration

Isothermal titration calorimetry (ITC) is widely employed to measure thermodynamic properties of binding interactions between two macromolecules or a macromolecule and a small ligand. No labeling of interacting species is required for ITC, but this advantage is offset by potentially material-consuming experimental optimization complicated by an indirect readout of an ITC titration. Here we present a simple, practical, and portable spreadsheet-based tool for planning and modeling an ITC titration experiment accompanied by basic guidelines.