نتایج جستجو برای: sequencing problem

تعداد نتایج: 1002313  

2016
Ching-Jung Ting

Cross-docking is a an important logistics strategy in which freight is unloaded from inbound vehicles and directly loaded into outbound vehicles, with little or no storage in between. This study considers a crossdocking system which combines the vehicle routing problem with crossdocking (VRPCD) for both inbound and outbound operations and truck sequencing problem at docks. The objective is to m...

Journal: :European Journal of Operational Research 2010
Uli Golle Nils Boysen Franz Rothlauf

This paper presents novel approaches for generating sequencing rules for the car sequencing (CS) problem in cases of two and multiple processing times per station. The CS problem decides on the succession of different car models launched down a mixed-model assembly line. It aims to avoid work overloads at the stations of the line by applying so-called sequencing rules, which restrict the maximu...

Journal: :modares journal of medical sciences: pathobiology 2012
elham ahmadi hooreih soleimanjahi majid sadegizadeh ali teimoori

objective: group a rotaviruses (garv) are responsible for the vast majority of severe diarrhea worldwide that kills an estimated 600,000-870,000 children annually. since infantile gastroenteritis is a main health problem, therefore diagnosis and treatment of this disease is crucial. gene rearrangements have been detected in vitro during serial passages of the virus at a high multiplicity of inf...

2003
Sebastian Böcker Robert Giegerich Ralf Hofestädt Franz Kummert Peter Ladkin Ralf Möller Helge Ritter Gerhard Sagerer Jens Stoye Ipke Wachsmuth SEBASTIAN BÖCKER Sebastian Boecker

One of the main endeavors in today’s Life Science remains the efficient sequencing of long DNA molecules. Today, most de-novo sequencing of DNA is still performed using electrophoresis-based Sanger Sequencing, based on the Sanger concept of 1977. Methods using mass spectrometry to acquire the Sanger Sequencing data are limited by short sequencing lengths of 15–25 nt. Recently, we proposed a new...

1998
Johann Hurink

In this paper we will consider a one-machine batching problem which is a combination of a sequencing and a partitioning problem. We will develop an exponential neighborhood for this problem which can be evaluated in quadratic time using shortest path calculations. Results of a computational study are reported.

This paper addresses a new mixed integer nonlinear and linear mathematical programming economic lot sizing and scheduling problem in distributed permutation flow shop problem with number of identical factories and machines. Different products must be distributed between the factories and then assignment of products to factories and sequencing of the products assigned to each factory has to be d...

Open-Pit Production Scheduling (OPPS) problem focuses on determining a block sequencing and scheduling to maximize Net Present Value (NPV) of the venture under constraints. The scheduling model is critically sensitive to the economic value volatility of block, block weight, and operational capacity. In order to deal with the OPPS uncertainties, various approaches can be recommended. Robust opti...

2007
Roel Boumen

Testing complex manufacturing systems, such as an ASML [ASML, 2006] lithographic machine, takes up to 45% of the total development time of a system. The problem of which tests must be executed in what sequence to ensure in the shortest possible test time that the system works, the test sequencing problem, was already solved by Pattipati [Pattipati et al., 1991; Pattipati and Alexandridis, 1990]...

Journal: :Bioinformatics 2014
Yi Li Xiaohui Xie

MOTIVATION Next-generation sequencing (NGS) has revolutionized the study of cancer genomes. However, the reads obtained from NGS of tumor samples often consist of a mixture of normal and tumor cells, which themselves can be of multiple clonal types. A prominent problem in the analysis of cancer genome sequencing data is deconvolving the mixture to identify the reads associated with tumor cells ...

1996
Michael Wooldridge Stefan Bussmann Marcus Klosterberg

The production sequencing problem involves a factory generating a product sequence such that when processed, the sequence will both satisfy current orders, and minimize overall costs. In this paper, we argue that production sequencing may fruitfully be considered as a negotiation problem, in which production cells within a factory negotiate over product sequences in order to fairly distribute c...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید