Clarisse Dhaenens

Learn More
A batch processing machine can simultaneously process several jobs forming a batch. This paper considers the problem of scheduling jobs with non-identical capacity requirements, on a single-batch processing machine of a given capacity, to minimize the makespan. The processing time of a batch is equal to the largest processing time of any job in the batch.(More)
1 CINVESTAV-IPN, Departamento de Computación, Av. IPN No. 2508, Col. San Pedro Zacatenco, México, D.F. 07300, Mexico ccoello@cs.cinvestav.mx 2 Laboratoire d’Informatique Fondamentale de Lille (LIFL), UMR CNRS 8022, Université Lille 1, Bâtiment M3, 59655 Villeneuve d’Ascq cedex, France 3 INRIA Lille-Nord Europe, Parc Scientifique de la Haute Borne, 40 avenue(More)
An important task of knowledge discovery deals with discovering association rules. This very general model has been widely studied and efficient algorithms have been proposed. But most of the time, only frequent rules are seeked. Here we propose to consider this problem as a multi-objective combinatorial optimization problem in order to be able to also find(More)
Parallel partitioning method (PPM): A new exact method to solve bi-objective problems. HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research(More)
Fitness landscape analysis aims to understand the geometry of a given optimization problem in order to design more efficient search algorithms. However, there is a very little knowledge on the landscape of multiobjective problems. In this work, following a recent proposal by Zitzler et al. (2010), we consider multiobjective optimization as a set problem.(More)
This paper deals with a dial-a-ride problem with time windows applied to a demand responsive transport service. An evolutionary approach as well as new original representation and variation operators are proposed and detailed. Such mechanisms are used with three state-of-the-art multi-objective evolutionary algorithms: NSGA-II, IBEA and SPEA2. After(More)