ADAM10 (A Disintegrin and Metalloprotease domain-containing protein 10) is a cell surface protein with a unique structure possessing both potential adhesion and protease domains. However, the role of ADAM10 in preimplantation stage embryos is not clear. In this study, we examined the expression patterns and functional roles of ADAM10 in porcine parthenotes during preimplantation development. Th...

We consider in this paper the two-machine no-wait flowshop problem in which each machine may have an unavailable interval. We present 3 2 -approximation algorithms for the problem when the unavailable interval is imposed on only one machine, or the unavailable intervals on the two machines overlap. These algorithms improve on existing results.

This research is motivated by the practical pre-steelmaking stage in large iron and steel companies, which have steady heavy demands for steelmaking production process. Our problem studied stage, consists of two steps that are needed each convertor before During step, a necessary transportation must be operated crane. In contrast to classical two-machine flowshop during both machines fixed, the...

This paper studies the two-machine flowshop scheduling problem with anticipatory setup times and an availability constraint imposed on only one of the machines where interrupted jobs can resume their operations. We present two heuristics and show that their worst-case error bounds are no larger than 2/3.

We consider in this paper the two-machine flowshop scheduling problem with total tardiness minimization. We propose a genetic algorithm and a matheuristic algorithm. Some computational experiments are described and the results show that these methods outperform other existing methods based on truncated branch-and-bound algorithms. Some future research directions are given, both in terms of eval...

This paper presents a new heuristic named GAPH based on a structural property for minimizing makespan in no-wait flowshop with sequence-dependent setup times. Experimental results demonstrate the superiority of the proposed approach over thhree of the best-know methods in the literature. Experimental and statistical analyses show that the new heuristic provides better solutions regarding the so...

We consider the NP-hard no-wait flowshop scheduling problem with sequence-dependent setup times to minimize makespan. We propose a hybrid heuristic which combines the iterated greedy process with local search method based on a block swap operator. Experimental results show that the proposed heuristic is comparatively more effective than the existing metaheuristics.

We consider in this paper the two-machine no-wait flowshop scheduling problem in which each machine may have an unavailable interval. We present a polynomial time approximation scheme for the problem when the unavailable interval is imposed on only one machine, or the unavailable intervals on the two machines overlap.