An exact parallel method for a bi-objective permutation flowshop problem

被引：27

作者：

Lemesre, J. ^{[1
]}

Dhaenens, C. ^{[1
]}

Talbi, E. G. ^{[1
]}

机构：

[1] Univ Lille 1, LIFL, F-59655 Villeneuve Dascq, France

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2007年 / 177卷 / 03期

关键词：

exact method; parallel method; bi-objective combinatorial optimization pfoblem; permutation flowshop;

D O I：

10.1016/j.ejor.2005.10.011

中图分类号：

C93 [管理学];

学科分类号：

12 [管理学]; 1201 [管理科学与工程]; 1202 [工商管理学]; 120202 [企业管理];

摘要：

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.

引用

页码：1641 / 1655

页数：15

共 24 条

[1]

BASSEUR M, 2004, WORKSH EXP EFF ALG W, P72

[2]

Benchmarks for shop scheduling problems [J].