An efficient heuristic for joint replenishment problems

Research output: Contribution to conferenceAbstractpeer-review

Abstract

We consider joint replenishment problems with stochastic demands. A major setup cost is incurred for every order, and a minor, item specific setup cost is incurred for every item. Proportional holding cost is incurred for every item carried from one period to the next period, and proportional shortage cost is incurred for every item unable to be filled immediately on demand. In this paper, we present a mixed integer linear programming (MILP) formulation, which employs the piecewise linearization technique, for computing the near-optimal policies. In contrast to other approaches in the literature, our heuristic can be easily implemented and solved by using off-the-shelf mathematical programming packages. Computational experiments demonstrate that the optimality gap of the MILP model is tighter and the computational time is reasonable.
Original languageEnglish
Publication statusPublished - 11 Jul 2018
Event29th European Conference on Operational Research - http://euro2018valencia.com/, Valencia, Spain
Duration: 8 Jul 201811 Jul 2018

Conference

Conference29th European Conference on Operational Research
Abbreviated titleEURO 2018
CountrySpain
CityValencia
Period8/07/1811/07/18

Fingerprint Dive into the research topics of 'An efficient heuristic for joint replenishment problems'. Together they form a unique fingerprint.

Cite this