کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1033151 | 943285 | 2007 | 8 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
On the NEH heuristic for minimizing the makespan in permutation flow shops
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
علوم انسانی و اجتماعی
مدیریت، کسب و کار و حسابداری
استراتژی و مدیریت استراتژیک
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: On the NEH heuristic for minimizing the makespan in permutation flow shops On the NEH heuristic for minimizing the makespan in permutation flow shops](/preview/png/1033151.png)
چکیده انگلیسی
Over the last 20 years the NEH heuristic of Nawaz, Enscore, and Ham published in this journal has been commonly regarded as the best heuristic for minimizing the makespan in permutation flow shops. In recent years some authors claimed to develop new heuristics that are competitive or outperform NEH. Our study reveals that these claims are not justified. We also address the issue of a fair comparison of the NEH results with those obtained by metaheuristics. Finally we conduct a thorough analysis of NEH leading to its modification which secures the optimality in the two-machine case and improves the general performance.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Omega - Volume 35, Issue 1, February 2007, Pages 53–60
Journal: Omega - Volume 35, Issue 1, February 2007, Pages 53–60
نویسندگان
Pawel Jan Kalczynski, Jerzy Kamburowski,