کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
5082683 | 1477651 | 2006 | 22 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A bounded dynamic programming solution to the batching problem in mixed-model just-in-time manufacturing systems
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
سایر رشته های مهندسی
مهندسی صنعتی و تولید
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A bounded dynamic programming solution to the batching problem in mixed-model just-in-time manufacturing systems A bounded dynamic programming solution to the batching problem in mixed-model just-in-time manufacturing systems](/preview/png/5082683.png)
چکیده انگلیسی
The batch production smoothing problem (BPSP) aims at finding appropriate batch sizes for a variety of products and sequencing the batches in such a way that their appearances are uniformly dispersed over the planning horizon. Extending the previous research work on the BPSP, this paper introduces a bounded dynamic programming (BDP) approach. Computational experiments prove that the BDP approach reduces the computational time needed to solve the problem significantly and allows larger-size problems to be solved within practical times.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: International Journal of Production Economics - Volume 103, Issue 2, October 2006, Pages 841-862
Journal: International Journal of Production Economics - Volume 103, Issue 2, October 2006, Pages 841-862
نویسندگان
Mesut Yavuz, Suleyman Tufekci,