This paper addresses the jobshop and the flowshop scheduling problems with minimum and maximum time lags. To solve this kind of problems, we propose adaptations of Climbing Discrepancy Search (CDS). We study various parameter settings. Computational experiments are provided to evaluate the propositions.

This paper studies the two-machine permutation flowshop scheduling problem with anticipatory setup times and an availability constraint imposed only on the first machine. The objective is to minimize the makespan. Under the assumption that interrupted jobs can resume their operations, we present a polynomial-time approximation scheme (PTAS) for this problem.

Misassembly due to the presence of repetitive DNA sequences often complicates the contig assembly stage of genome sequencing. Accurate physical representations of chromosomes, such as restriction maps or contig maps, provide a means for validating the sequence assembly and clarifying alignment ambiguity. The Contig Assembly Verifier (CAVe) software tool allows the researcher to automatically re...

The preprotein translocase of the outer mitochondrial membrane (TOM) consists of a central β-barrel channel, Tom40, and six proteins with α-helical transmembrane segments. The precursor of Tom40 is imported from the cytosol by a pre-existing TOM complex and inserted into the outer membrane by the sorting and assembly machinery (SAM). Tom40 then assembles with α-helical Tom proteins to the matur...

The preprotein translocase of the outer mitochondrial membrane (TOM) consists of a central -barrel channel, Tom40, and six proteins with -helical transmembrane segments. The precursor of Tom40 is imported from the cytosol by a pre-existing TOM complex and inserted into the outer membrane by the sorting and assembly machinery (SAM). Tom40 then assembles with -helical Tom proteins to the mature T...

This paper studies the problem of scheduling N jobs in a hybrid flowshop with unrelated parallel machines at each stage. Considering practical application presented problem, no-wait constraints and objective function total flowtime are included problem. A mathematical model is constructed novel genetic simulated annealing algorithm so-called GSAA developed to solve this In algorithm, firstly mo...