Heuristic for a single period single product closed loop supply chain

Neelesh Rangwani, P. Subramanian, N. Ramkumar and T.T. Narendran

International Journal of Enterprise Network Management, 2011, vol. 4, issue 3, 311-324

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.

Keywords: closed loop supply chains; SCM; supply chain management; integer linear programmes; VAM-TOC; Vogel; approximation methods; total opportunity costs; single period; single product; progressive heuristics; constructive heuristics; enterprise network management. (search for similar items in EconPapers)
Date: 2011
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.inderscience.com/link.php?id=41159 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijenma:v:4:y:2011:i:3:p:311-324

Access Statistics for this article

More articles in International Journal of Enterprise Network Management from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().