Heuristic for a single period single product closed loop supply chain Online publication date: Wed, 22-Oct-2014
by Neelesh Rangwani, P. Subramanian, N. Ramkumar, T.T. Narendran
International Journal of Enterprise Network Management (IJENM), Vol. 4, No. 3, 2011
Abstract: This paper addresses a single period, single product closed loop supply chain (CLSC) allocation problem. We propose an integer linear programming (ILP) model and a progressive constructive heuristics based on Vogel's approximation method-total opportunity cost (VAM-TOC) method. Trials on a number of datasets have yielded encouraging results.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 Enterprise Network Management (IJENM):
Login with your Inderscience username and 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