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

Authors:
Ming-Jong Yao;Weng-Ming Chu;Yen-Fei Lin
Affiliations:
Department of Industrial Engineering and Enterprise Information, Tunghai University, 180, Sec. 3, Taichung-Kang Road, Taichung City 40407, Taiwan;Department of Industrial Engineering and Enterprise Information, Tunghai University, 180, Sec. 3, Taichung-Kang Road, Taichung City 40407, Taiwan;FAB 12 MFG-P3, Taiwan Semiconductor Manufacturing Company, Ltd., 6, Creation RD.2, Science-Based Industrial Park, Hsinchu 30077, Taiwan
Venue:
Computers and Operations Research
Year:
2008

Citing 4
Cited 0

Optimization by simulated annealing: an experimental evaluation. Part I, graph partitioning

Operations Research
The peak load minimization problem in cyclic production

Computers and Operations Research
Multistage Lot Sizing Problems via Randomized Rounding

Operations Research
A global optimum search algorithm for the joint replenishment problem under power-of-two policy

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

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.