کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4960020 | 1445964 | 2017 | 38 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation
ترجمه فارسی عنوان
دیدگاه جدیدی از روش های تقریبی برای جریان زیرگروه برای به حداقل رساندن مگاپن: ارزیابی پیشرفته و محاسباتی
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
چکیده انگلیسی
The permutation flowshop problem is a classic machine scheduling problem where n jobs must be processed on a set of m machines disposed in series and where each job must visit all machines in the same order. Many production scheduling problems resemble flowshops and hence it has generated much interest and had a big impact in the field, resulting in literally hundreds of heuristic and metaheuristic methods over the last 60 years. However, most methods proposed for makespan minimisation are not properly compared with existing procedures so currently it is not possible to know which are the most efficient methods for the problem regarding the quality of the solutions obtained and the computational effort required. In this paper, we identify and exhaustively compare the best existing heuristics and metaheuristics so the state-of-the-art regarding approximate procedures for this relevant problem is established.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 257, Issue 3, 16 March 2017, Pages 707-721
Journal: European Journal of Operational Research - Volume 257, Issue 3, 16 March 2017, Pages 707-721
نویسندگان
Victor Fernandez-Viagas, Rubén Ruiz, Jose M. Framinan,