A Lagrangian relaxation heuristic for solving the multi-echelon, multi-commodity, close-loop supply chain network design problem
by Hokey Min, Hyun Jeung Ko, Byung In Park
International Journal of Logistics Systems and Management (IJLSM), Vol. 1, No. 4, 2005

Abstract: In some industries such as e-tailing, e-auction and catalog sales, returns account for significant portions of total shipments, causing substantial increases in cost. As cost pressures continue to mount in this era of economic slowdowns, returns management has become a top priority for companies seeking to increase their bottom lines. As such, there is a growing need for developing a close-loop supply chain network that can help companies coordinate and manage both forward and reverse logistics flows associated with product sales and recovery. However, most of the existing studies on closed-loop supply chains focus on the backward flow of returned products and neglect the multi-echelon, integrated aspects of both forward and reverse logistics activities. To study this aspect of the problem, this paper proposes a Lagrangian relaxation heuristic for solving the practical size return centre location-allocation problem within closed-loop supply chains.

Online publication date: Mon, 14-Feb-2005

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 Logistics Systems and Management (IJLSM):
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