Linear programming models for a stochastic dynamic capacitated lot sizing problem |
Abstract:
In this paper the stochastic dynamic lot sizing problem with multiple items and limited capacity under two types of fill rate constraints is considered. It is assumed that according to the static-uncertainty strategy of Bookbinder and Tan, the production periods as well as the lot sizes are fixed in advance for the entire planning horizon and are executed regardless of the realisation of the demands. We propose linear programming models, where the non-linear functions of the expected backorders and the expected inventory on hand are approximated by piecewise linear functions. The resulting models are solved with a variant of the Fix-and-Optimize heuristic. The results are compared with those of the column generation heuristic proposed by Tempelmeier.
|
Keywords: |
Lot sizing; Random demand; Dynamic demand; Capacities |
Author(s): |
Horst Tempelmeier, Timo Hilger |
Source: |
Computers & Operations Research Volume 59, July 2015, Pages 119–125 |
Subject: |
تحقیق در عملیات |
Category: |
مقالات ترجمه شده - دانلود ترجمه مقاله |
Release Date: |
2015 |
No of Pages: |
7 |
Price(Tomans): |
0 |
بر اساس شرایط و ضوابط ارسال مقاله در سایت مدیر، این مطلب توسط یکی از نویسندگان ارسال گردیده است. در صورت مشاهده هرگونه تخلف، با تکمیل فرم گزارش تخلف حقوق مؤلفین مراتب را جهت پیگیری اطلاع دهید.
|
ترجمه این مقاله موجود است. مشاهده ترجمه مقاله
|