An exact parallel method for a bi-objective permutation flowshop problem |
| |
Authors: | J Lemesre C Dhaenens EG Talbi |
| |
Institution: | LIFL, Bâtiment M3, Université de Lille I, 59655 Villeneuve d’Ascq cedex, France |
| |
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. |
| |
Keywords: | Exact method Parallel method Bi-objective combinatorial optimization problem Permutation flowshop |
本文献已被 ScienceDirect 等数据库收录! |