Constraint programming for computing non-stationary (R, S) inventory policies

TARIM Ş. A., Smith B. M.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, cilt.189, sa.3, ss.1004-1021, 2008 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 189 Sayı: 3
  • Basım Tarihi: 2008
  • Doi Numarası: 10.1016/j.ejor.2006.11.048
  • Dergi Adı: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.1004-1021
  • Hacettepe Üniversitesi Adresli: Hayır

Özet

This paper proposes a constraint programming model for computing the finite horizon single-item inventory problem with stochastic demands in discrete time periods with service-level constraints under the non-stationary version of the "periodic review, order-up-to-level" policy (i.e., non-stationary (R, S) or, simply (R, S,)). It is observed that the modeling process is more natural and the required number of variables is smaller compared to the MIP formulation of the same problem. The computational tests show that the CP approach is more tractable than the conventional MIP formulation. Two different domain reduction methods are proposed to improve the computational performance of solution algorithms. The numerical experiments confirmed the effectiveness of these methods. (C) 2007 Elsevier B.V. All rights reserved.