کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
10348031 | 699386 | 2012 | 13 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals](/preview/png/10348031.png)
چکیده انگلیسی
In this paper, we consider a single batch machine scheduling problem with incompatible job families and dynamic job arrivals. The objective is to minimize the total completion time. This problem is known to be strongly NP-hard. We present several dominance properties and two types of lower bounds, which are incorporated to construct a basic branch and bound algorithm. Furthermore, according to the characteristics of dynamic job arrivals, a decomposed branch and bound algorithm is proposed to improve the efficiency. The proposed algorithms are tested on a large set of randomly generated problem instances.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 39, Issue 5, May 2012, Pages 939-951
Journal: Computers & Operations Research - Volume 39, Issue 5, May 2012, Pages 939-951
نویسندگان
Shiqing Yao, Zhibin Jiang, Na Li,