Deterministic hierarchical substitution inventory models

H. Gurnani, Z. Drezner

Research output: Contribution to journalArticle

28 Citations (Scopus)

Abstract

In this paper, we consider a deterministic nested substitution problem where there are multiple products which can be substituted one for the other, if necessary, at a certain cost. We consider the case when there are n products, and product j can substitute products j+1, ..., n at certain costs. The trade-off is the cost of storing products (for example, customized products) at a higher inventory holding stage versus the cost of transferring downwards from a lower inventory holding cost (generic product) stage. The standard approach to solving the problem yields an intractable formulation, but by reformulating the problem to determine the optimal run-out times, we are able to determine the optimal order and substitution quantities. Numerical examples showing the effect of various system parameters on the optimal order and substitution policy are also presented.

Original languageEnglish (US)
Pages (from-to)129-133
Number of pages5
JournalJournal of the Operational Research Society
Volume51
Issue number1
StatePublished - Jan 2000
Externally publishedYes

Fingerprint

Substitution reactions
Costs
Substitution
Inventory model

ASJC Scopus subject areas

  • Management of Technology and Innovation
  • Strategy and Management
  • Management Science and Operations Research

Cite this

Deterministic hierarchical substitution inventory models. / Gurnani, H.; Drezner, Z.

In: Journal of the Operational Research Society, Vol. 51, No. 1, 01.2000, p. 129-133.

Research output: Contribution to journalArticle

Gurnani, H. ; Drezner, Z. / Deterministic hierarchical substitution inventory models. In: Journal of the Operational Research Society. 2000 ; Vol. 51, No. 1. pp. 129-133.
@article{d793cb9d7fd446aeab00abc912cbb4ad,
title = "Deterministic hierarchical substitution inventory models",
abstract = "In this paper, we consider a deterministic nested substitution problem where there are multiple products which can be substituted one for the other, if necessary, at a certain cost. We consider the case when there are n products, and product j can substitute products j+1, ..., n at certain costs. The trade-off is the cost of storing products (for example, customized products) at a higher inventory holding stage versus the cost of transferring downwards from a lower inventory holding cost (generic product) stage. The standard approach to solving the problem yields an intractable formulation, but by reformulating the problem to determine the optimal run-out times, we are able to determine the optimal order and substitution quantities. Numerical examples showing the effect of various system parameters on the optimal order and substitution policy are also presented.",
author = "H. Gurnani and Z. Drezner",
year = "2000",
month = "1",
language = "English (US)",
volume = "51",
pages = "129--133",
journal = "Journal of the Operational Research Society",
issn = "0160-5682",
publisher = "Palgrave Macmillan Ltd.",
number = "1",

}

TY - JOUR

T1 - Deterministic hierarchical substitution inventory models

AU - Gurnani, H.

AU - Drezner, Z.

PY - 2000/1

Y1 - 2000/1

N2 - In this paper, we consider a deterministic nested substitution problem where there are multiple products which can be substituted one for the other, if necessary, at a certain cost. We consider the case when there are n products, and product j can substitute products j+1, ..., n at certain costs. The trade-off is the cost of storing products (for example, customized products) at a higher inventory holding stage versus the cost of transferring downwards from a lower inventory holding cost (generic product) stage. The standard approach to solving the problem yields an intractable formulation, but by reformulating the problem to determine the optimal run-out times, we are able to determine the optimal order and substitution quantities. Numerical examples showing the effect of various system parameters on the optimal order and substitution policy are also presented.

AB - In this paper, we consider a deterministic nested substitution problem where there are multiple products which can be substituted one for the other, if necessary, at a certain cost. We consider the case when there are n products, and product j can substitute products j+1, ..., n at certain costs. The trade-off is the cost of storing products (for example, customized products) at a higher inventory holding stage versus the cost of transferring downwards from a lower inventory holding cost (generic product) stage. The standard approach to solving the problem yields an intractable formulation, but by reformulating the problem to determine the optimal run-out times, we are able to determine the optimal order and substitution quantities. Numerical examples showing the effect of various system parameters on the optimal order and substitution policy are also presented.

UR - http://www.scopus.com/inward/record.url?scp=0033904595&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033904595&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0033904595

VL - 51

SP - 129

EP - 133

JO - Journal of the Operational Research Society

JF - Journal of the Operational Research Society

SN - 0160-5682

IS - 1

ER -