Order quantities for perishable inventory control with non-stationary demand and a fill rate constraint

Research output: Contribution to journalArticleAcademicpeer-review

19 Citations (Scopus)

Abstract

We study the practical decision problem of fresh food production with a long production lead time to decide every period (e.g. week) how many items to produce. When a batch is ready for use, its items have a fixed shelf life, after which the items become waste in the sense that they cannot be sold anymore. The demand for (fresh) food products is uncertain and highly fluctuating, mainly caused by price promotions of retail organisations. We focus on cases where a so-called cycle fill rate service level requirement applies. We investigate the generation of a production plan that fixes the timing and quantity of the production for a finite time horizon. To minimise waste, one issues the oldest items first, i.e. a FIFO issuing policy. In case of out-of-stock, sales are lost.

We model this decision problem as a Stochastic Programming (SP) model. The objective of our study is to find order quantities for the SP model, that approximately meet cycle fill rate service level requirements while keeping outdating low. To find approximate solutions for the SP model, an MILP model is developed. The MILP model is a deterministic approximation that generates feasible replenishment quantities in less than a second. With a scenario-based MINLP approach, optimal solutions are generated for a large sample of demand paths as a benchmark for the MILP solutions. We show that the MILP model is suitable for practical use if the setup cost is such that the replenishment cycles in the production plan are close to or of the same length as the maximum shelf life. In those cases, the expected total costs are close to the costs of the optimal solution and the average fill rate is close to the required one.
LanguageEnglish
Pages238-246
JournalInternational Journal of Production Economics
Volume181
DOIs
Publication statusPublished - 2016

Fingerprint

Inventory control
Stochastic programming
Costs
Order quantity
Non-stationary demand
Sales
Mixed integer linear programming

Cite this

@article{910d54f2cb14472ca73c8759111a39b3,
title = "Order quantities for perishable inventory control with non-stationary demand and a fill rate constraint",
abstract = "We study the practical decision problem of fresh food production with a long production lead time to decide every period (e.g. week) how many items to produce. When a batch is ready for use, its items have a fixed shelf life, after which the items become waste in the sense that they cannot be sold anymore. The demand for (fresh) food products is uncertain and highly fluctuating, mainly caused by price promotions of retail organisations. We focus on cases where a so-called cycle fill rate service level requirement applies. We investigate the generation of a production plan that fixes the timing and quantity of the production for a finite time horizon. To minimise waste, one issues the oldest items first, i.e. a FIFO issuing policy. In case of out-of-stock, sales are lost.We model this decision problem as a Stochastic Programming (SP) model. The objective of our study is to find order quantities for the SP model, that approximately meet cycle fill rate service level requirements while keeping outdating low. To find approximate solutions for the SP model, an MILP model is developed. The MILP model is a deterministic approximation that generates feasible replenishment quantities in less than a second. With a scenario-based MINLP approach, optimal solutions are generated for a large sample of demand paths as a benchmark for the MILP solutions. We show that the MILP model is suitable for practical use if the setup cost is such that the replenishment cycles in the production plan are close to or of the same length as the maximum shelf life. In those cases, the expected total costs are close to the costs of the optimal solution and the average fill rate is close to the required one.",
author = "K.G.J. Pauls-Worm and E.M.T. Hendrix and A.G. Alcoba and R. Haijema",
year = "2016",
doi = "10.1016/j.ijpe.2015.10.009",
language = "English",
volume = "181",
pages = "238--246",
journal = "International Journal of Production Economics",
issn = "0925-5273",
publisher = "Elsevier",

}

Order quantities for perishable inventory control with non-stationary demand and a fill rate constraint. / Pauls-Worm, K.G.J.; Hendrix, E.M.T.; Alcoba, A.G.; Haijema, R.

In: International Journal of Production Economics, Vol. 181, 2016, p. 238-246.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

T1 - Order quantities for perishable inventory control with non-stationary demand and a fill rate constraint

AU - Pauls-Worm, K.G.J.

AU - Hendrix, E.M.T.

AU - Alcoba, A.G.

AU - Haijema, R.

PY - 2016

Y1 - 2016

N2 - We study the practical decision problem of fresh food production with a long production lead time to decide every period (e.g. week) how many items to produce. When a batch is ready for use, its items have a fixed shelf life, after which the items become waste in the sense that they cannot be sold anymore. The demand for (fresh) food products is uncertain and highly fluctuating, mainly caused by price promotions of retail organisations. We focus on cases where a so-called cycle fill rate service level requirement applies. We investigate the generation of a production plan that fixes the timing and quantity of the production for a finite time horizon. To minimise waste, one issues the oldest items first, i.e. a FIFO issuing policy. In case of out-of-stock, sales are lost.We model this decision problem as a Stochastic Programming (SP) model. The objective of our study is to find order quantities for the SP model, that approximately meet cycle fill rate service level requirements while keeping outdating low. To find approximate solutions for the SP model, an MILP model is developed. The MILP model is a deterministic approximation that generates feasible replenishment quantities in less than a second. With a scenario-based MINLP approach, optimal solutions are generated for a large sample of demand paths as a benchmark for the MILP solutions. We show that the MILP model is suitable for practical use if the setup cost is such that the replenishment cycles in the production plan are close to or of the same length as the maximum shelf life. In those cases, the expected total costs are close to the costs of the optimal solution and the average fill rate is close to the required one.

AB - We study the practical decision problem of fresh food production with a long production lead time to decide every period (e.g. week) how many items to produce. When a batch is ready for use, its items have a fixed shelf life, after which the items become waste in the sense that they cannot be sold anymore. The demand for (fresh) food products is uncertain and highly fluctuating, mainly caused by price promotions of retail organisations. We focus on cases where a so-called cycle fill rate service level requirement applies. We investigate the generation of a production plan that fixes the timing and quantity of the production for a finite time horizon. To minimise waste, one issues the oldest items first, i.e. a FIFO issuing policy. In case of out-of-stock, sales are lost.We model this decision problem as a Stochastic Programming (SP) model. The objective of our study is to find order quantities for the SP model, that approximately meet cycle fill rate service level requirements while keeping outdating low. To find approximate solutions for the SP model, an MILP model is developed. The MILP model is a deterministic approximation that generates feasible replenishment quantities in less than a second. With a scenario-based MINLP approach, optimal solutions are generated for a large sample of demand paths as a benchmark for the MILP solutions. We show that the MILP model is suitable for practical use if the setup cost is such that the replenishment cycles in the production plan are close to or of the same length as the maximum shelf life. In those cases, the expected total costs are close to the costs of the optimal solution and the average fill rate is close to the required one.

U2 - 10.1016/j.ijpe.2015.10.009

DO - 10.1016/j.ijpe.2015.10.009

M3 - Article

VL - 181

SP - 238

EP - 246

JO - International Journal of Production Economics

T2 - International Journal of Production Economics

JF - International Journal of Production Economics

SN - 0925-5273

ER -