Two classes of one machine sequencing situations are considered in which each job corresponds to exactly one player but a player may have more than one job to be processed, so called RP(repeated player) sequencing situations. In max-RP sequencing situations it is assumed that each player’s cost function is linear with respect to the maximum completion time of his jobs, whereas in min-RP sequenc...

A no-wait robotic cell is an automated ow shop in which a robot is used to move the parts from a machine to the next. Parts are not allowed to wait. We analyze the complexity of the part sequencing problem in a robotic cell with three machines, for di erent periodical patterns of robot moves, when the objective is productivity maximization. c © 2000 Elsevier Science B.V. All rights reserved.

Rapid sequencing of individual human genome is prerequisite to genomic medicine, where diseases will be prevented by preemptive cures. Quantum-mechanical tunneling through single-stranded DNA in a solid-state nanopore has been proposed for rapid DNA sequencing, but unfortunately the tunneling current alone cannot distinguish the four nucleotides due to large fluctuations in molecular conformati...

The fully annotated genome sequence of the European strain, 26695 was first published in 1997 and, in 1999, it was directly compared to the USA isolate J99, promoting two standard laboratory isolates for Helicobacter pylori (H. pylori) research. With the genomic scaffolds available from these important genomes and the advent of benchtop high-throughput sequencing technology, a bacterial genome ...

Consider the problem of sequencing n jobs with general precedence constraints on a single machine to minimize total weighted completion time, which is NP-complete. However some class of problems can be solved in polynomial time, i.e .. the problems whose precedence constraints are trees or series parallel. This paper proposes an O(n4) algorithm for implementing a decomposition procedure due to ...

Various integer programming models have been proposed for sequencing problems. However, little is known about the practical value of these models. This paper reports a comparison of six different integer programming formulations of the single-machine total tardiness problem. We created a set of especially difficult test problems and attempted to solve them with each of the formulations, using C...

Transpose-and-Cache Branch-and-Bound (TCBB) has shown promise in solving large single machine quadratic penalty problems. There exist other classes of single machine job sequencing problems which are of more practical importance and which are also of considerable interest in the area of AI search. In the weighted earliness tardiness problem (WET), the best known heuristic estimate is not consis...