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
关键词
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].
Demirkol, E ;
Mehta, S ;
Uzsoy, R .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1998, 109 (01) :137-141
[3]
MINIMIZING TOTAL TARDINESS ON ONE MACHINE IS NP-HARD [J].
DU, JZ ;
LEUNG, JYT .
MATHEMATICS OF OPERATIONS RESEARCH, 1990, 15 (03) :483-495
[4]
A survey and annotated bibliography of multiobjective combinatorial optimization [J].
Ehrgott M. ;
Gandibleux X. .
OR-Spektrum, 2000, 22 (4) :425-460
[5]
Garey M. R., 1976, Mathematics of Operations Research, V1, P117, DOI 10.1287/moor.1.2.117
[6]
[7]
Graham R. L., 1979, Discrete Optimisation, P287
[8]
HAIMES YY, 1971, IEEE T SYST MAN CYB, VSMC1, P296
[9]
JACKSON J, NAVAL RES LOGISTICS, V3
[10]
Johnson Selmer Martin., 1954, NAV RES LOG, V1, P61, DOI [10.1002/(ISSN)1931-9193, DOI 10.1002/NAV.3800010110, 10.1002/nav.3800010110]