Approximate dynamic programming algorithms for multidimensional flexible production-inventory problems


ÇİMEN M. , KIRKBRIDE C.

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, cilt.55, ss.2034-2050, 2017 (SCI İndekslerine Giren Dergi) identifier identifier

  • Cilt numarası: 55 Konu: 7
  • Basım Tarihi: 2017
  • Doi Numarası: 10.1080/00207543.2016.1264643
  • Dergi Adı: INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
  • Sayfa Sayıları: ss.2034-2050

Özet

An important issue in the manufacturing and supply chain literature concerns the optimisation of inventory decisions. Single-product inventory problems are widely studied and have been optimally solved under a variety of assumptions and settings. However, as systems become more complex, inventory decisions become more complicated for which the methods/approaches for optimising single inventory systems are incapable of deriving optimal policies. Manufacturing process flexibility provides an example of such a complex application area. Decisions involving the interrelated product inventories and production facilities form a highly multidimensional, non-decomposable system for which optimal policies cannot be readily obtained. We propose the methodology of approximate dynamic programming ( ADP) to overcome the computational challenge imposed by this multidimensionality. Incorporating a sample backup simulation approach, ADP develops policies by utilising only a fraction of the computations required by classical dynamic programming. However, there are few studies in the literature that optimise production decisions in a stochastic, multi-factory, multi-product inventory system of this complexity. This paper aims to explore the feasibility and relevancy of ADP algorithms for this application. We present the results from numerical experiments that establish the strong performance of policies developed via temporal difference ADP algorithms in comparison to optimal policies and to policies derived from a deterministic approximation of the problem.