Lageroptimering : Minimera tiden till leverans med begränsat lagerutrymme

Detta är en Kandidat-uppsats från KTH/Optimeringslära och systemteori; KTH/Optimeringslära och systemteori

Författare: Marcus Ahlberg; Jimmy Lilja; [2016]

Nyckelord: ;


This thesis presents a study in mathematical optimization of the inventory routine at the company Aktiebolaget Kronborsten. The thesis establishes a general optimization problem identified at Kronborstens inventory routine. The identified problem is to find the optimal mix between products in the finished goods inventory, which minimizes the expected time until delivery.

The proposed model assumes that orders and manufacturing follow a stochastic process. With these assumptions the inventory and manufacturing are represented as several independent Markov processes. From the stationary distribution of these processes a function was identified for the expected time until delivery for a given solution. The identified function had convex properties which made it possible to solve the optimization problem using the marginal allocation algorithm.

The mathematical problem is followed by a chapter about the costs related to storage. The purpose of this chapter is to help Kronborsten to valuate their options and consequences of strategical decisions about the inventory levels. 

  HÄR KAN DU HÄMTA UPPSATSEN I FULLTEXT. (följ länken till nästa sida)