کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4959069 1445467 2017 11 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A beam-search-based constructive heuristic for the PFSP to minimise total flowtime
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
A beam-search-based constructive heuristic for the PFSP to minimise total flowtime
چکیده انگلیسی
The results obtained by the proposed algorithm outperform those obtained by other constructive heuristics in the literature for the problem, thus modifying substantially the state-of-the-art of efficient approximate procedures for the problem. In addition, the proposed algorithm even outperforms two of the best metaheuristics for many instances of the problem, using much lesser computation effort. The excellent performance of the proposal is also proved by the fact that the new heuristic found new best upper bounds for 35 of the 120 instances in Taillard's benchmark.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 81, May 2017, Pages 167-177
نویسندگان
, ,