Hier finden Sie wissenschaftliche Publikationen aus den Fraunhofer-Instituten.

Container fleet management in closed-loop supply chains

: Jami, Neil

Fulltext urn:nbn:de:0011-n-4613458 (68 KByte PDF) - Diese Fassung wurde vom Autor zurückgezogen.
MD5 Fingerprint: 548431928326793a8d44fc4f90caedee
Created on: 01.09.2017

Fulltext urn:nbn:de:0011-n-461345-16 (2.4 MByte PDF) - Aktualisierte Fassung
MD5 Fingerprint: 3d36b4d8d65807f6a36af974ec8b2ed0
Created on: 1.9.2017


Stuttgart: Fraunhofer Verlag, 2017, VII, 231 pp.
Zugl.: Kaiserslautern, Univ., Diss., 2016
ISBN: 978-3-8396-1210-1
Dissertation, Electronic Publication
Fraunhofer ITWM ()
discrete mathematic; combinatorics & graph theory; transport planning & policy; Optimierung; diskrete Mathematik; Kombinatorik; Graphentheorie; Transportplanung; Politik; Mathematiker; Wirtschaftswissenschaftler

The objective of this thesis is to develop models and algorithms to plan the purchasing of reusable containers in a closed-loop supply chain where the demand is increasing. We restrict our study to a periodic review process between a single manufacturer and a single supplier. Each item is transported either in a reusable container or in a single-use disposable. Furthermore, a setup cost is paid every time new containers are purchased. Consequently, our model is similar to a lot-sizing problem with return of every item after a fixed duration. We study both cases of a deterministic demand as well as a stochastic demand. In the deterministic setting, we use dynamic programming and minimum linear-cost flows to generate polynomial time algorithms. When the demand is stochastic, we use the Markov decision process framework to develop pseudo-polynomial time heuristics for four different strategies. We show the L-natural-convexity of the cost functions for three strategies to speed up the computations. The thesis concludes with an application on a real-life supply chain.