کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
477933 | 1446220 | 2006 | 16 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
An investigation of buffer sizing techniques in critical chain scheduling
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
In this paper, we introduce two methods for determining feeding buffer sizes in critical chain project scheduling. Both methods integrate project characteristics into the formulation. Specifically, one of them incorporates resource tightness while the other uses network complexity. Both methods are tested and compared to two commonly suggested methods in the literature, the cut and paste method and the root square error method, as well as using no buffer as a benchmark. The comparison is done by means of a simulation study using the Patterson data set. The test results indicate that both of the suggested methods generate smaller buffer sizes while providing sufficient protection against delays in project completion time.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 172, Issue 2, 16 July 2006, Pages 401–416
Journal: European Journal of Operational Research - Volume 172, Issue 2, 16 July 2006, Pages 401–416
نویسندگان
Oya I. Tukel, Walter O. Rom, Sandra Duni Eksioglu,