دانلود مقاله ISI انگلیسی شماره 22670
ترجمه فارسی عنوان مقاله

تعیین اندازه دسته تولید دو مرحله ای مطلوب و سیاست های دسته بندی موجودی

عنوان انگلیسی
On optimal two-stage lot sizing and inventory batching policies
کد مقاله سال انتشار تعداد صفحات مقاله انگلیسی
22670 2000 10 صفحه PDF
منبع

Publisher : Elsevier - Science Direct (الزویر - ساینس دایرکت)

Journal : International Journal of Production Economics, Volume 66, Issue 2, 30 June 2000, Pages 149–158

ترجمه کلمات کلیدی
- سیاست های دسته بندی موجودی - تعیین اندازه دسته تولید دو مرحله ای -
کلمات کلیدی انگلیسی
Inventory batching policies, Two-stage lot sizing,
پیش نمایش مقاله
پیش نمایش مقاله  تعیین اندازه دسته تولید دو مرحله ای مطلوب و سیاست های دسته بندی موجودی

چکیده انگلیسی

A recent paper considered the two-stage lot-sizing problem with finite production rates at both stages. The problem was classified according to: whether the production rate at the first stage is greater or less than that at the second stage, whether the production batch size at the first stage is greater or less than that at the second stage and whether the transfer from the first stage to the second stage is continuous or in batches. The objective of this note is to offer an alternative (more direct and intuitive) way to derive and present essentially similar results and also to extend the analysis by relaxing one of the assumptions.

مقدمه انگلیسی

In an interesting recent paper [1] Kim carried out a thorough analysis of the two-stage lot-sizing problem with finite production rates at both stages. By considering the various ways of classifying such a model an optimal solution procedure was derived and presented. The objective of this note is to suggest an alternative way of performing the analysis which we believe to be more intuitive and concise and therefore possibly easier to understand. In addition, by relaxing one of the key assumptions it is shown how the policy space can be extended and lower cost policies derived.

نتیجه گیری انگلیسی

An algorithm procedure for tackling a particular problem is fairly fully described by Kim [1]. It is important to note that if all the batch sizes at a given stage are required to be equal then it is quite possible that better solutions may be achieved by considering schedules for which View the MathML source, where m and n have no common factors (other than 1) and both m and n are greater than 1. In this case the cycle time is View the MathML source which is neither View the MathML source nor View the MathML source. However, such solutions would be difficult to find and even more difficult to sell to management and implement in practice.