Determination of replenishment dates for restricted-storage, static demand, cyclic replenishment schedule

Ming-Jong Yao*, Weng Ming Chu, Yen Fei Lin

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

8 Scopus citations

Abstract

This study focuses on scheduling replenishment lots of multiple products in a warehouse with restricted storage space where the replenishment cycle time of each product is given and is an integer multiple of some basic period. Assuming that the warehouse replenishes at the beginning of some basic period, this study proposes a new heuristic that utilizes two simple procedures to generate a replenishment schedule that minimizes the maximum warehouse-space requirement. By including a re-optimization mechanism and a Boltzmann function, the proposed heuristic obtains solutions very close to the global optimum within a reasonable run time. Using randomly generated instances, this study shows that the proposed heuristic significantly outperforms a previously published heuristic.

Original languageEnglish
Pages (from-to)3230-3242
Number of pages13
JournalComputers and Operations Research
Volume35
Issue number10
DOIs
StatePublished - 1 Oct 2008

Keywords

  • Heuristic
  • Lot storage space
  • Replenishment schedule

Fingerprint Dive into the research topics of 'Determination of replenishment dates for restricted-storage, static demand, cyclic replenishment schedule'. Together they form a unique fingerprint.

Cite this