کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
475516 | 699321 | 2007 | 22 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Scheduling with flexible resources in parallel workcenters to minimize maximum completion time
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Scheduling with flexible resources in parallel workcenters to minimize maximum completion time Scheduling with flexible resources in parallel workcenters to minimize maximum completion time](/preview/png/475516.png)
چکیده انگلیسی
In this paper we consider the parallel machine scheduling problem with dual resource constraints with the objective of minimizing the maximum completion time. We develop heuristics that combine list-scheduling and bin-packing approaches with rules to iteratively modify the flexible resource allocation. A lower bound is presented and the previous and proposed solution approaches to the problem are analyzed under a variety of experimental conditions, demonstrating that there are advantages to the proposed heuristics.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 34, Issue 1, January 2007, Pages 48–69
Journal: Computers & Operations Research - Volume 34, Issue 1, January 2007, Pages 48–69
نویسندگان
Alex J. Ruiz-Torres, Grisselle Centeno,