Level Scheduling for batched JIT supply

A mixed-model assembly line requires the solution of a short-term sequencing problem which decides on the succession of different models launched down the line. A famous solution approach stemming from the Toyota Production System is the so-called Level Scheduling, which aims at distributing the part consumption induced by the model sequence evenly over time. Traditional Level Scheduling seeks to closely approximate target demand rates at every production cycle, however, such a strict leveling is only required if parts are directly pulled from a connected feeder line. In real-world assembly lines, parts are predominately delivered in (small) batches at certain points in time. In such a situation, a Just-in-Time supply is already facilitated whenever the cumulative consumption is leveled in accordance with each part’s delivery schedule, while the exact consumption pattern between two delivery points seems irrelevant. The paper on hand provides new Level Scheduling models, proves complexity, presents exact and heuristic solution procedures and shows inferiority of traditional Level Scheduling for such a batched JIT-supply of parts.     

Sequencing by Cyclic Ligation and Cleavage (CycLiC) directly on a microarray captured template

Next generation sequencing methods that can be applied to both the resequencing of whole genomes and to the selective resequencing of specific parts of genomes are needed. We describe (i) a massively scalable biochemistry, Cyclical Ligation and Cleavage (CycLiC) for contiguous base sequencing and (ii) apply it directly to a template captured on a microarray. CycLiC uses four color-coded DNA/RNA chimeric oligonucleotide libraries (OL) to extend a primer, a base at a time, along a template. The cycles comprise the steps: (i) ligation of OLs, (ii) identification of extended base by label detection, and (iii) cleavage to remove label/terminator and undetermined bases. For proof-of-principle, we show that the method conforms to design and that we can read contiguous bases of sequence correctly from a template captured by hybridization from solution to a microarray probe. The method is amenable to massive scale-up, miniaturization and automation. Implementation on a microarray format offers the potential for both selection and sequencing of a large number of genomic regions on a single platform. Because the method uses commonly available reagents it can be developed further by a community of users.     

Balancing and Scheduling Mixed-Model U-Shaped Production Lines

The production line considered in this paper is a U-shaped, mixed-model, asynchronous line where assembly and fabrication tasks are performed to produce a variety of different discrete products or models in a just-in-time (JIT) environment. Two important problems occur routinely with these lines. The first is the assignment of tasks to stations on the line—the line balancing problem—and the second is the selection of the sequence in which models will be produced—the model sequencing problem. The model sequence cannot be set independently of the line balance, because different models require different tasks and the same tasks have different completion times for different models, and, in the JIT environment, the model sequence cannot be set independently of the schedules of other lines and production facilities. JIT uses a pull rather than a push system of production control, which means that the model sequence at the U-shaped mixed-model final assembly line sets the schedules at the other production facilities. JIT requires these latter schedules to be “level” and this requirement imposes an additional constraint on the model sequence. The effect of these two conditions is to require that the line-balancing and model-sequencing problems be solved simultaneously. In this article, we model the joint problem and present a solution algorithm for solving instances of practical size.     

Improvement of earliness and lateness by postponement on an automotive production line

This article takes an interest in improving the performance of a subproblem of car sequencing: the resequencing problem. It extends a model of assembly line with the simulation of buffer stocks with drawers. Presequencing and resequencing are modeled with different types of stock management policy. Furthermore, postponement is introduced by two points of differentiation within the line. After choosing relevant variables and performance indicators a large-scale design of experiments finally enables to estimate average improvement brought by postponement to more than 39.7%, compared to the situation without postponement.     

GReEn: a tool for efficient compression of genome resequencing data

Research in the genomic sciences is confronted with the volume of sequencing and resequencing data increasing at a higher pace than that of data storage and communication resources, shifting a significant part of research budgets from the sequencing component of a project to the computational one. Hence, being able to efficiently store sequencing and resequencing data is a problem of paramount importance. In this article, we describe GReEn (Genome Resequencing Encoding), a tool for compressing genome resequencing data using a reference genome sequence. It overcomes some drawbacks of the recently proposed tool GRS, namely, the possibility of compressing sequences that cannot be handled by GRS, faster running times and compression gains of over 100-fold for some sequences. This tool is freely available for non-commercial use at ftp://ftp.ieeta.pt/~ap/codecs/GReEn1.tar.gz.     

Piscine Reovirus: Genomic and Molecular Phylogenetic Analysis from Farmed and Wild Salmonids Collected on the Canada/US Pacific Coast

Piscine reovirus (PRV) is a double stranded non-enveloped RNA virus detected in farmed and wild salmonids. This study examined the phylogenetic relationships among different PRV sequence types present in samples from salmonids in Western Canada and the US, including Alaska (US), British Columbia (Canada) and Washington State (US). Tissues testing positive for PRV were partially sequenced for segment S1, producing 71 sequences that grouped into 10 unique sequence types. Sequence analysis revealed no identifiable geographical or temporal variation among the sequence types. Identical sequence types were found in fish sampled in 2001, 2005 and 2014. In addition, PRV positive samples from fish derived from Alaska, British Columbia and Washington State share identical sequence types. Comparative analysis of the phylogenetic tree indicated that Canada/US Pacific Northwest sequences formed a subgroup with some Norwegian sequence types (group II), distinct from other Norwegian and Chilean sequences (groups I, III and IV). Representative PRV positive samples from farmed and wild fish in British Columbia and Washington State were subjected to genome sequencing using next generation sequencing methods. Individual analysis of each of the 10 partial segments indicated that the Canadian and US PRV sequence types clustered separately from available whole genome sequences of some Norwegian and Chilean sequences for all segments except the segment S4. In summary, PRV was genetically homogenous over a large geographic distance (Alaska to Washington State), and the sequence types were relatively stable over a 13 year period.     

BreaKmer: detection of structural variation in targeted massively parallel sequencing data using kmers

Genomic structural variation (SV), a common hallmark of cancer, has important predictive and therapeutic implications. However, accurately detecting SV using high-throughput sequencing data remains challenging, especially for ‘targeted’ resequencing efforts. This is critically important in the clinical setting where targeted resequencing is frequently being applied to rapidly assess clinically actionable mutations in tumor biopsies in a cost-effective manner. We present BreaKmer, a novel approach that uses a ‘kmer’ strategy to assemble misaligned sequence reads for predicting insertions, deletions, inversions, tandem duplications and translocations at base-pair resolution in targeted resequencing data. Variants are predicted by realigning an assembled consensus sequence created from sequence reads that were abnormally aligned to the reference genome. Using targeted resequencing data from tumor specimens with orthogonally validated SV, non-tumor samples and whole-genome sequencing data, BreaKmer had a 97.4% overall sensitivity for known events and predicted 17 positively validated, novel variants. Relative to four publically available algorithms, BreaKmer detected SV with increased sensitivity and limited calls in non-tumor samples, key features for variant analysis of tumor specimens in both the clinical and research settings.     

Sequence Polymorphism Discovery in Wheat Microsatellite Flanking Regions using Pyrophosphate Sequencing

Sequence polymorphisms such as insertion/deletions (indels) and single nucleotide polymorphisms (SNP) are suitable for automated analysis of molecular markers and useful for cultivar identification, genetic mapping and trait association. While they are abundant, their initial discovery, comprising detection, validation and characterisation of sequence polymorphisms, is time consuming and expensive. This is especially true for multi-allellic hexaploid wheat. We investigated simple sequence repeat (SSR) flanking regions as a source for sequence polymorphisms in wheat. SSRs have a potentially high polymorphic frequency, there are a large number of highly characterised markers available, tested primers are published and most are single locus. Of 126 markers investigated, polymorphisms were found in 33 (26%) when tested in 10 wheat varieties. No new primers needed to be designed, the published primer sequences were used as PCR primers and then as sequencing primers. Polymorphism was detected by resequencing using a modification of pyrophosphate sequencing (Pyrosequencing^®) which yielded quality sequencing from the first base after the primer with up to 80 bases of information. Our method of pyrophosphate sequencing of SSRs, although not suitable for full-length sequencing, is an attractive method to directly find sequence polymorphism in varieties of interest using the abundant, well characterised and published SSR markers.     

Large scale loss of data in low-diversity illumina sequencing libraries can be recovered by deferred cluster calling

Massively parallel DNA sequencing is capable of sequencing tens of millions of DNA fragments at the same time. However, sequence bias in the initial cycles, which are used to determine the coordinates of individual clusters, causes a loss of fidelity in cluster identification on Illumina Genome Analysers. This can result in a significant reduction in the numbers of clusters that can be analysed. Such low sample diversity is an intrinsic problem of sequencing libraries that are generated by restriction enzyme digestion, such as e4C-seq or reduced-representation libraries. Similarly, this problem can also arise through the combined sequencing of barcoded, multiplexed libraries. We describe a procedure to defer the mapping of cluster coordinates until low-diversity sequences have been passed. This simple procedure can recover substantial amounts of next generation sequencing data that would otherwise be lost.     

Whole-genome sequencing and variant discovery in C. elegans

Massively parallel sequencing instruments enable rapid and inexpensive DNA sequence data production. Because these instruments are new, their data require characterization with respect to accuracy and utility. To address this, we sequenced a Caernohabditis elegans N2 Bristol strain isolate using the Solexa Sequence Analyzer, and compared the reads to the reference genome to characterize the data and to evaluate coverage and representation. Massively parallel sequencing facilitates strain-to-reference comparison for genome-wide sequence variant discovery. Owing to the short-read-length sequences produced, we developed a revised approach to determine the regions of the genome to which short reads could be uniquely mapped. We then aligned Solexa reads from C. elegans strain CB4858 to the reference, and screened for single-nucleotide polymorphisms (SNPs) and small indels. This study demonstrates the utility of massively parallel short read sequencing for whole genome resequencing and for accurate discovery of genome-wide polymorphisms.     

Efficient targeted resequencing of human germline and cancer genomes by oligonucleotide-selective sequencing

We describe an approach for targeted genome resequencing, called oligonucleotide-selective sequencing (OS-Seq), in which we modify the immobilized lawn of oligonucleotide primers of a next-generation DNA sequencer to function as both a capture and sequencing substrate. We apply OS-Seq to resequence the exons of either 10 or 344 cancer genes from human DNA samples. In our assessment of capture performance, >87% of the captured sequence originated from the intended target region with sequencing coverage falling within a tenfold range for a majority of all targets. Single nucleotide variants (SNVs) called from OS-Seq data agreed with >95% of variants obtained from whole-genome sequencing of the same individual. We also demonstrate mutation discovery from a colorectal cancer tumor sample matched with normal tissue. Overall, we show the robust performance and utility of OS-Seq for the resequencing analysis of human germline and cancer genomes.     

MutMap+: Genetic Mapping and Mutant Identification without Crossing in Rice

Advances in genome sequencing technologies have enabled researchers and breeders to rapidly associate phenotypic variation to genome sequence differences. We recently took advantage of next-generation sequencing technology to develop MutMap, a method that allows rapid identification of causal nucleotide changes of rice mutants by whole genome resequencing of pooled DNA of mutant F2 progeny derived from crosses made between candidate mutants and the parental line. Here we describe MutMap+, a versatile extension of MutMap, that identifies causal mutations by comparing SNP frequencies of bulked DNA of mutant and wild-type progeny of M3 generation derived from selfing of an M2 heterozygous individual. Notably, MutMap+ does not necessitate artificial crossing between mutants and the wild-type parental line. This method is therefore suitable for identifying mutations that cause early development lethality, sterility, or generally hamper crossing. Furthermore, MutMap+ is potentially useful for gene isolation in crops that are recalcitrant to artificial crosses.     

The elimination of fox rabies from Europe: determinants of success and lessons for the future

Despite perceived challenges to controlling an infectious disease in wildlife, oral rabies vaccination (ORV) of foxes has proved a remarkably successful tool and a prime example of a sophisticated strategy to eliminate disease from wildlife reservoirs. During the past three decades, the implementation of ORV programmes in 24 countries has led to the elimination of fox-mediated rabies from vast areas of Western and Central Europe. In this study, we evaluated the efficiency of 22 European ORV programmes between 1978 and 2010. During this period an area of almost 1.9 million km² was targeted at least once with vaccine baits, with control taking between 5 and 26 years depending upon the country. We examined factors influencing effort required both to control and eliminate fox rabies as well as cost-related issues of these programmes. The proportion of land area ever affected by rabies and an index capturing the size and overlap of successive ORV campaigns were identified as factors having statistically significant effects on the number of campaigns required to both control and eliminate rabies. Repeat comprehensive campaigns that are wholly overlapping much more rapidly eliminate infection and are less costly in the long term. Disproportionally greater effort is required in the final phase of an ORV programme, with a median of 11 additional campaigns required to eliminate disease once incidence has been reduced by 90 per cent. If successive ORV campaigns span the entire affected area, rabies will be eliminated more rapidly than if campaigns are implemented in a less comprehensive manner, therefore reducing ORV expenditure in the longer term. These findings should help improve the planning and implementation of ORV programmes, and facilitate future decision-making by veterinary authorities and policy-makers.     

DNA sequencing by denaturation: principle and thermodynamic simulations

We describe a new DNA sequencing method called sequencing by denaturation (SBD). A Sanger dideoxy sequencing reaction is performed on the templates on a solid surface to generate a ladder of DNA fragments randomly terminated by fluorescently labeled dideoxyribonucleotides. The labeled DNA fragments are sequentially denatured from the templates and the process is monitored by measuring the change in fluorescence intensities from the surface. By analyzing the denaturation profiles, the base sequence of the template can be determined. Using thermodynamic principles, we simulated the denaturation profiles of a series of oligonucleotides ranging from 12 to 32 bases and developed a base-calling algorithm to decode the sequences. These simulations demonstrate that DNA molecules up to 20 bases can be sequenced by SBD. Experimental measurements of the melting profiles of DNA fragments in solution confirm that DNA sequences can be determined by SBD. The potential limitations and advantages of SBD are discussed. With SBD, millions of sequencing reactions can be performed on a small area on a surface in parallel with a very small amount of sequencing reagents. Therefore, DNA sequencing by SBD could potentially result in a significant increase in speed and reduction in cost in large-scale genome resequencing.     

Production planning of a flexible manufacturing system in a material requirements planning environment

Early flexible manufacturing system (FMS) production planning models exhibited a variety of planning objectives; typically, these objectives were independent of the overall production environment. More recently, some researchers have proposed hierarchical production planning and scheduling models for FMS. In this article, we examine production planning of FMS in a material requirements planning (MRP) environment. We propose a hierarchical structure that integrates FMS production planning into a closed-loop MRP system. This structure gives rise to the FMS/MRP rough-cut capacity planning (FMRCP) problem, the FMS/MRP grouping and loading (FMGL) problem, and the FMS/MRP detailed scheduling problem. We examine the FMRCP and FMGL problems in detail and present mathematical programming models for each of these problems. In particular, the FMRCP problem is modeled as a generalized assignment problem (GAP), and a GAP-based heuristic procedure is defined for the problem. We define a two-phase heuristic for the FMGL problem and present computational experience with both heuristics. The FMRCP heuristic is shown to solve problems that exhibit a dependent-demand relation within the FMS and with FMS capacity utilization as high as 99 percent. The FMGL heuristic requires very little CPU time and obtains solutions to the test problems that are on average within 1.5 percent of a theoretical lower bound. This FMS/MRP production planning framework, together with the resulting models, constitutes an important step in the integration of FMS technology with MRP production planning. The hierarchical planning mechanism directly provides for system-level MRP planning priorities to induce appropriate production planning and control objectives on the FMS while simultaneously allowing for necessary feedback from the FMS. Moreover, by demonstrating the tractability of the FMRCP and FMGL problems, this research establishes the necessary groundwork upon which to explore systemwide issues pertaining to the coordination of the hierarchical structure.     

Enriching targeted sequencing experiments for rare disease alleles

MOTIVATION: Next-generation targeted resequencing of genome-wide association study (GWAS)-associated genomic regions is a common approach for follow-up of indirect association of common alleles. However, it is prohibitively expensive to sequence all the samples from a well-powered GWAS study with sufficient depth of coverage to accurately call rare genotypes. As a result, many studies may use next-generation sequencing for single nucleotide polymorphism (SNP) discovery in a smaller number of samples, with the intent to genotype candidate SNPs with rare alleles captured by resequencing. This approach is reasonable, but may be inefficient for rare alleles if samples are not carefully selected for the resequencing experiment. RESULTS: We have developed a probability-based approach, SampleSeq, to select samples for a targeted resequencing experiment that increases the yield of rare disease alleles substantially over random sampling of cases or controls or sampling based on genotypes at associated SNPs from GWAS data. This technique allows for smaller sample sizes for resequencing experiments, or allows the capture of rarer risk alleles. When following up multiple regions, SampleSeq selects subjects with an even representation of all the regions. SampleSeq also can be used to calculate the sample size needed for the resequencing to increase the chance of successful capture of rare alleles of desired frequencies. SOFTWARE: http://biostat.mc.vanderbilt.edu/SampleSeq     

Targeted multiplex next‐generation sequencing: advances in techniques of mitochondrial and nuclear DNA sequencing for population genomics

Next‐generation sequencing (NGS) is emerging as an efficient and cost‐effective tool in population genomic analyses of nonmodel organisms, allowing simultaneous resequencing of many regions of multi‐genomic DNA from multiplexed samples. Here, we detail our synthesis of protocols for targeted resequencing of mitochondrial and nuclear loci by generating indexed genomic libraries for multiplexing up to 100 individuals in a single sequencing pool, and then enriching the pooled library using custom DNA capture arrays. Our use of DNA sequence from one species to capture and enrich the sequencing libraries of another species (i.e. cross‐species DNA capture) indicates that efficient enrichment occurs when sequences are up to about 12% divergent, allowing us to take advantage of genomic information in one species to sequence orthologous regions in related species. In addition to a complete mitochondrial genome on each array, we have included between 43 and 118 nuclear loci for low‐coverage sequencing of between 18 kb and 87 kb of DNA sequence per individual for single nucleotide polymorphisms discovery from 50 to 100 individuals in a single sequencing lane. Using this method, we have generated a total of over 500 whole mitochondrial genomes from seven cetacean species and green sea turtles. The greater variation detected in mitogenomes relative to short mtDNA sequences is helping to resolve genetic structure ranging from geographic to species‐level differences. These NGS and analysis techniques have allowed for simultaneous population genomic studies of mtDNA and nDNA with greater genomic coverage and phylogeographic resolution than has previously been possible in marine mammals and turtles.     

Application of genetic algorithms for sequencing of AS/RS with a triple-shuttle module in class-based storage

Materials handling systems, as a main support to the dynamism of logistic systems, must be highly productive, well utilised, and very efficiently controlled. In the case of high volume, large capacity warehouse systems, an AS/RS (automatic storage/retrieval system) is a typical solution to these requirements. The performance of an AS/RS is closely related to the implementation of different control policies. The sequencing policy, used to create minimum overall handling time tours, has a great impact on system performances. The selection of an appropriate sequencing method is even more significant in a more complex case of multiple shuttle S/R (storage/retrieval) devices because of the mutual paring between more than one storing and retrieving tasks. This paper is focused on the sequencing problem of a triple-shuttle AS/RS in a class-based storage system under a modified sextuple command cycle policy with a planning horizon that comprises the realisation of several successive cycles of S/R device. To solve the problem, three commonly used greedy heuristics (nearest neighbour, reversed nearest neighbour, and shortest leg) are adapted, and a genetic algorithm is proposed.