کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
473157 698775 2012 8 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
An improved heuristic for parallel machine weighted flowtime scheduling with family set-up times
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
An improved heuristic for parallel machine weighted flowtime scheduling with family set-up times
چکیده انگلیسی

This paper studies the identical parallel machine scheduling problem with family set-up times and an objective of minimizing total weighted completion time (weighted flowtime). The family set-up time is incurred whenever there is a switch of processing from a job in one family to a job in another family. A heuristic is proposed in this paper for the problem. Computational results show that the proposed heuristic outperforms an existing heuristic, especially for large-sized problems, in terms of both solution quality and computation times. The improvement of solution quality is as high as 4.753% for six-machine problem and 7.822% for nine-machine problem, while the proposed heuristic runs three times faster than the existing one.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Mathematics with Applications - Volume 63, Issue 1, January 2012, Pages 110–117
نویسندگان
, , ,