.png){kind=icon}
.png){kind=icon}
Return
An exact parallel method for a bi-objective permutation flowshop problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2005.10.011.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
exact method
parallel method
bi-objective combinatorial optimization pfoblem
permutation flowshop
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available