A combinatorial optimisation approach for closed-loop supply chain inventory planning with deterministic demand Online publication date: Sat, 01-Jul-2017
by Pierre Desport; Frédéric Lardeux; David Lesaint; Carla Di Cairano-Gilfedder; Anne Liret; Gilbert Owusu
European J. of Industrial Engineering (EJIE), Vol. 11, No. 3, 2017
Abstract: Supply chains in equipment-intensive service industries often involve repair operations. In this context, tactical inventory planning is concerned with optimally planning supplies and repairs based on demand forecasts and in the face of conflicting business objectives. This paper considers closed-loop supply chains and proposes a mixed-integer programming model and a metaheuristic approach to this problem. The model is open to a variety of network topologies, site functions and transfer policies. It also accommodates multiple objectives by the means of a weighted cost function. We report experiments on pseudo-random instances designed to evaluate plan quality and impact of cost weightings. In particular, we show how appropriate weightings allow to implement common planning strategies (e.g., just-in-time replenishment, minimal repair). [Received 8 May 2016; Revised 24 October 2016; Accepted 2 December 2016]
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 European J. of Industrial Engineering (EJIE):
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
Our Blog 
Follow us on Twitter 
Visit us on Facebook