Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
483260 | European Journal of Operational Research | 2007 | 15 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
J. Lemesre, C. Dhaenens, E.G. Talbi,