کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
475372 699295 2009 12 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers
چکیده انگلیسی

This paper investigates the hybrid flowshop scheduling with finite intermediate buffers, whose objective is to minimize the sum of weighted completion time of all jobs. Since this problem is very complex and has been proven strongly NP-hard, a tabu search heuristic is proposed. In this heuristic there are two main features. One is that a scatter search mechanism is incorporated to improve the diversity of the search procedure. And the other is that a permutation of N jobs representing their processing order in the first stage instead of a complex complete schedule is used to denote a solution. Computational experiments on randomly generated instances with different structures show that the proposed tabu search heuristic can provide good solutions compared to both the lower bounds and the algorithm proposed for this problem in a lately published literature.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 36, Issue 3, March 2009, Pages 907–918
نویسندگان
, ,