Dynamic lot size problems with one-way product substitution

Vernon Ning Hsu, Chung Lun Li, Wen Qiang Xiao

Research output: Journal article publicationJournal articleAcademic researchpeer-review

48 Citations (Scopus)


We consider two multi-product dynamic lot size models with one-way substitution, where the products can be indexed such that a lower-index product may be used to substitute for the demand of a higher-index product. In the first model, the product used to meet the demand of another product must be physically transformed into the latter and incur a conversion cost. In the second model, a product can be directly used to satisfy the demand for another product without requiring any physical conversion. Both problems are generally computationally intractable. We develop dynamic programming algorithms that solve the problems in polynomial time when the number of products is fixed. A heuristic is also developed, and computational experiments are conducted to test the effectiveness of the heuristic and the efficiency of the optimal algorithm.
Original languageEnglish
Pages (from-to)201-215
Number of pages15
JournalIIE Transactions (Institute of Industrial Engineers)
Issue number3
Publication statusPublished - 1 Mar 2005

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering


Dive into the research topics of 'Dynamic lot size problems with one-way product substitution'. Together they form a unique fingerprint.

Cite this