کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
474082 698840 2008 15 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes
چکیده انگلیسی

This paper investigates the scheduling problem of parallel identical batch processing machines in which each machine can process a group of jobs simultaneously as a batch. Each job is characterized by its size and processing time. The processing time of a batch is given by the longest processing time among all jobs in the batch. Based on developing heuristic approaches, we proposed a hybrid genetic heuristic (HGH) to minimize makespan objective. To verify the performance of our algorithm, comparisons are made through using a simulated annealing (SA) approach addressed in the literature as a comparator algorithm. Computational experiments reveal that affording the knowledge of problem through using heuristic procedures, gives HGH the ability of finding optimal or near optimal solutions in a reasonable time.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 35, Issue 4, April 2008, Pages 1084–1098
نویسندگان
, , ,