期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 177, 期 3, 页码 1641-1655出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ejor.2005.10.011
关键词
exact method; parallel method; bi-objective combinatorial optimization pfoblem; permutation flowshop
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. (c) 2005 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据