Complete search procedure for replenishment and collection policies in a product life cycle for a retailer
by Tzu-Chun Weng
International Journal of Mathematics in Operational Research (IJMOR), Vol. 8, No. 3, 2016

Abstract: In this paper, assuming the retailer is responsible for used-product collection, we investigate replenishment and collection policies by considering a general, time-varying, continuous, and deterministic demand function for a product life cycle. The objection is to optimally determine the number of inventory replenishments, the inventory replenishment time points, and the return rates of used-product in the product life cycle by minimising the total relevant cost of the inventory replenishment and used-product collection system. 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, numerical examples are carried out to illustrate the features of the proposed problem discussed in this paper.

Online publication date: Mon, 28-Mar-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com