STOCHASTIC DYNAMIC LOTSIZING PROBLEM WITH TOTAL QUANTITY DISCOUNT

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

KHOSRAVI S.; MIRMOHAMMADI S.H.

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: INDUSTRIAL ENGINEERING & MANAGEMENT SHARIF (SHARIF: ENGINEERING) Year:2018 | Volume:34-1 | Issue:1/1 Page(s): 39-50

Download Full-Text

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Verion

View:

638

Download:

Cites:

Information Journal Paper

Title

STOCHASTIC DYNAMIC LOTSIZING PROBLEM WITH TOTAL QUANTITY DISCOUNT

Author(s)

KHOSRAVI S. | MIRMOHAMMADI S.H. | Issue Writer Certificate

Keywords

Dynamic lot sizing problemQ1

total quantity discountQ1

branch and bound algorithmQ1

dynamic programmingQ2

lagrangian relaxation methodQ1

Abstract

Dynamic lot sizing problem is one of the significant problems in industrial units and has been considered by many researchers. Considering the quantity discount in purchasing cost is one of the important and practical aspects of inventory problems in the field of inventory control and management, and it has been less focused in terms of stochastic version of dynamic lot-sizing problem in inventory management. In this paper, the stochastic dynamic lot-sizing problem with the assumption of existence of all-units quantity discount in purchasing is defined and formulated. Two approaches are presented to handle the solving procedure of this problem. Since the considered model is a mixed integer non-linear programing model, and the objective function of the model is the only non-linear part of the model. At first, we introduce a piecewise linear approximation model to convert the objective function to a linear term. The main solution approach breaks down the problem into four levels. At the first level, a branch and bound algorithm branches the problem on the periods with a predetermined discount level. In this case, the problem is converted to constrained version of the Sox problem [10]. This sub problem raised in each node in the branch and bound algorithm, is a mixed integer non-linear programing too, which is solved based on a dynamic programming approach in the second level. In each stage, in this dynamic programming algorithm, there is a sub-problem which is solved via a branch and bound algorithm. The problem raised in each node of the recent branch and bound algorithm is solved with lagrangian relaxation method. The numeric results found in this study indicate that the proposed approach solves the problem faster than the mathematical programming model using the commercial software GAMS. Moreover, the proposed algorithm for the two discount levels is also compared with the approximate solution in the mentioned software. The results indicate that our algorithm up to 14 periods can not only obtain the exact solution, but also consume less time in contrast to the approximate model.

Cites

No record.

References

No record.

Cite

APA: Copy

KHOSRAVI, S., & MIRMOHAMMADI, S.H.. (2018). STOCHASTIC DYNAMIC LOTSIZING PROBLEM WITH TOTAL QUANTITY DISCOUNT. INDUSTRIAL ENGINEERING & MANAGEMENT SHARIF (SHARIF: ENGINEERING), 34-1(1/1 ), 39-50. SID. https://sid.ir/paper/107675/en

Vancouver: Copy

KHOSRAVI S., MIRMOHAMMADI S.H.. STOCHASTIC DYNAMIC LOTSIZING PROBLEM WITH TOTAL QUANTITY DISCOUNT. INDUSTRIAL ENGINEERING & MANAGEMENT SHARIF (SHARIF: ENGINEERING)[Internet]. 2018;34-1(1/1 ):39-50. Available from: https://sid.ir/paper/107675/en

IEEE: Copy

S. KHOSRAVI, and S.H. MIRMOHAMMADI, “STOCHASTIC DYNAMIC LOTSIZING PROBLEM WITH TOTAL QUANTITY DISCOUNT,” INDUSTRIAL ENGINEERING & MANAGEMENT SHARIF (SHARIF: ENGINEERING), vol. 34-1, no. 1/1 , pp. 39–50, 2018, [Online]. Available: https://sid.ir/paper/107675/en

Related Journal Papers