{{model.bookDetails.title}}

ebook luisterboek
{{model.bookDetails.author}} Serie: {{model.bookDetails.series}} ({{model.bookDetails.seriesNumber}}) | Taal: {{model.bookDetails.language}}

{{getBindingWithHiding()}}

€ {{model.bookDetails.refPriceMaxText}}

€ {{model.bookDetails.priceText}}

€ {{model.bookDetails.mainCopy.regularPriceString}}

€ {{model.bookDetails.priceText}}

Niet leverbaar



{{model.bookDetails.deliveryMessage}}
Container Fleet Management in Closed-Loop Supply Chains

{{getBindingWithHiding()}}

€ {{model.bookDetails.priceText}}

Dit artikel kunt u momenteel niet bestellen. Mogelijk is het wel op voorraad bij een van de aangesloten boekhandels. Bekijk de winkelvoorraad hieronder ↓
Direct te downloaden
Uw bibliotheek altijd beschikbaar in uw account
Gemakkelijk synchroniseren met geselecteerde apps
Nieuwe boeken gratis bezorgd vanaf € 17,50 naar NL*
Altijd de laagste prijs voor nieuwe Nederlandstalige boeken
Ruilen of retourneren binnen 14 dagen
Koop lokaal, ook online!
Op voorraad bij: {{model.bookDetails.physicalShopsWithStock[0].Name}}
{{shop.name}}
Bekijk winkelvoorraad
Ik wil advies
Vraag de boekhandel
Prijsvoordeel *
*
{{model.bookDetails.mainCopy.priceDescription}}

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.
{{property.Key}}
*
*
*
{{review.reviewTitle}}
{{review.createdOn | date: 'dd-MM-yyyy' }} door {{review.reviewAlias}}
{{review.reviewText}}
Meer Recensies
Lees minder
Geen recensies beschikbaar.

{{webshopCopy.binding == null || webshopCopy.binding == '' ? 'Prijs' : webshopCopy.binding}} € {{webshopCopy.priceInCentsText}}

Bezorgen:

Prijs € {{usedCopy.priceInCentsText}}

Conditie: {{usedCopy.qualityName}}
{{usedCopy.copyDetailDescription}}
Levertijd:
Leverbaar bij:
{{usedCopy.shop.name}}
Je hebt recent geen producten bekeken
pro-mbooks3 : libris