Article ID: | iaor20084394 |
Country: | Netherlands |
Volume: | 177 |
Issue: | 3 |
Start Page Number: | 1641 |
End Page Number: | 1655 |
Publication Date: | Mar 2007 |
Journal: | European Journal of Operational Research |
Authors: | Talbi El-Ghazali, Lemesre J., Dhaenens Clarisse |
Keywords: | combinatorial optimization |
In this paper, we propose a parallel exact method to solve bi-objective combinatorial optimization problems. This method has been inspired by the two-phase method which is a very general scheme to optimally solve bi-objective combinatorial optimization problems. Here, we first show that applying such a method to a particular problem allows improvements. Secondly, we propose a parallel model to speed up the search. Experiments have been carried out on a bi-objective permutation flowshop problem for which we also propose a new lower bound.