کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
483260 | 1446204 | 2007 | 15 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
An exact parallel method for a bi-objective permutation flowshop problem
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: An exact parallel method for a bi-objective permutation flowshop problem An exact parallel method for a bi-objective permutation flowshop problem](/preview/png/483260.png)
چکیده انگلیسی
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.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 177, Issue 3, 16 March 2007, Pages 1641–1655
Journal: European Journal of Operational Research - Volume 177, Issue 3, 16 March 2007, Pages 1641–1655
نویسندگان
J. Lemesre, C. Dhaenens, E.G. Talbi,