کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
10523852 | 957103 | 2005 | 12 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Batched bin packing
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
کنترل و بهینه سازی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Batched bin packing Batched bin packing](/preview/png/10523852.png)
چکیده انگلیسی
We introduce and study the batched bin packing problem (BBPP), a bin packing problem in which items become available for packing incrementally, one batch at a time. A batched algorithm must pack a batch before the next batch becomes known. A batch may contain several items; the special case when each batch consists of merely one item is the well-studied on-line bin packing problem. We obtain lower bounds for the asymptotic competitive ratio of any algorithm for the BBPP with two batches. We believe that our main lower bound is optimal and provide some support to this conjecture. We suggest studying BBPP and other batched problems.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Optimization - Volume 2, Issue 1, 30 March 2005, Pages 71-82
Journal: Discrete Optimization - Volume 2, Issue 1, 30 March 2005, Pages 71-82
نویسندگان
Gregory Gutin, Tommy Jensen, Anders Yeo,