Skip to main content
Article thumbnail
Location of Repository

Dynamic lot sizing problem with continuous-time Markovian production cost

By Amir Azaron, Ou Tang and Reza Tavakkoli-Moghaddam


This paper develops a polynomial algorithm for obtaining dynamic economic lot sizes in a single product multiperiod production system with the objective of minimizing total production and inventory costs over T periods. It is assumed that production costs are linear, inventory costs are concave, setup costs are zero and backlogging is not permitted in all periods. Moreover, the unit production cost is a stochastic variable, which is evolved according to a continuous-time Markov process over the planning horizon. The model is formulated as a stochastic dynamic programming (DP) optimization with the state variable being unit production cost. Then, it is solved using the backward dynamic programming approach. To justify the application of the proposed model, two practical cases are presented.Dynamic lot sizing Dynamic programming Stochastic processes

OAI identifier:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.