Optimal replenishment policies with allowable shortages for a product life cycle

Authors:
Cheng-Kang Chen;Ta-Wei Hung;Tzu-Chun Weng
Affiliations:
Department of Information Management, National Taiwan University of Science and Technology, Taipei, Taiwan;Department of Information Management, Shih Chien University, Taipei, Taiwan;Department of Information Management, National Taiwan University of Science and Technology, Taipei, Taiwan
Venue:
Computers & Mathematics with Applications
Year:
2007

Citing 2
Cited 4

Comparison of heuristic procedures for the inventory replenishment problem with a linear trend in demand

Computers and Industrial Engineering
Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions

SIAM Journal on Optimization

Pricing and lot-sizing policies for deteriorating items with partial backlogging under inflation

Expert Systems with Applications: An International Journal
A particle swarm optimization for solving joint pricing and lot-sizing problem with fluctuating demand and unit purchasing cost

Computers & Mathematics with Applications
A particle swarm optimization for solving joint pricing and lot-sizing problem with fluctuating demand and trade credit financing

Computers and Industrial Engineering
A particle swarm optimization for solving lot-sizing problem with fluctuating demand and preservation technology cost under trade credit

Journal of Global Optimization

Quantified Score

Hi-index	0.09

Visualization

Abstract

In this paper, we investigate replenishment policies with allowable shortages by considering a general, time-varying, continuous, and deterministic demand function for a product life cycle. The objective is to optimally determine the number of inventory replenishments, the inventory replenishment time points, and the beginning time points of shortages within the product life cycle by minimizing the total relevant costs of the inventory replenishment system. The proposed problem is mathematically formulated as a mixed-integer nonlinear programming model. A complete search procedure is developed to find the optimal solution by employing the properties derived in this paper and the well-known Nelder-Mead algorithm. Also, several numerical examples and the corresponding sensitivity analyses are carried out to illustrate the features of our model by utilizing the search procedure developed in this paper.