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)
—Finding maximum likelihood parameter values for Finite Mixture Model (FMM) is often done with the Expectation Maximization (EM) algorithm. However the choice of initial values can severely affect the time to attain convergence of the algorithm and its efficiency in finding global maxima. We alleviate this defect by embedding the EM algorithm within the(More)