Abdelwaheb Rebaï

Learn More
The m-machine permutation flowshop problem PFSP with the objectives of minimizing the makespan and the total flowtime is a common scheduling problem, which is known to be NP-complete in the strong sense, when m P 3. This work proposes a new algorithm for solving the permutation FSP, namely combinatorial Particle Swarm Optimization. Furthermore , we(More)
We describe a method for constructing the confidence interval of the QTL location parameter. This method is developed in the local asymptotic framework, leading to a linear model at each position of the putative QTL. The idea is to construct a likelihood ratio test, using statistics whose asymptotic distribution does not depend on the nuisance parameters(More)
We present a general regression-based method for mapping quantitative trait loci (QTL) by combining different populations derived from diallel designs. The model expresses, at any map position, the phenotypic value of each individual as a function of the specific-mean of the population to which the individual belongs, the additive and dominance effects of(More)