Êtes-vous un étudiant de l'EPFL à la recherche d'un projet de semestre?
Travaillez avec nous sur des projets en science des données et en visualisation, et déployez votre projet sous forme d'application sur GraphSearch.
Concept
Dynamic lot-size model
Résumé
The dynamic lot-size model in inventory theory, is a generalization of the economic order quantity model that takes into account that demand for the product varies over time. The model was introduced by Harvey M. Wagner and Thomson M. Whitin in 1958.
We have available a forecast of product demand
dt over a relevant time horizon t=1,2,...,N (for example we might know how many widgets will be needed each week for the next 52 weeks). There is a setup cost st incurred for each order and there is an inventory holding cost it per item per period (st and it can also vary with time if desired). The problem is how many units xt to order now to minimize the sum of setup cost and inventory cost. Let us denote inventory:
The functional equation representing minimal cost policy is:
Where H() is the Heaviside step function. Wagner and Whitin proved the following four theorems:
There exists an optimal program such that Ixt=0; ∀t
There exists an optimal program such that ∀t: either xt=0 or for some k (t≤k≤N)
There exists an optimal program such that if dt* is satisfied by some xt**, t** t* it is sufficient to consider only t** ≤ j ≤ t. In particular, if t* = t**, then it is sufficient to consider programs such that xt* > 0.
Wagner and Whitin gave an algorithm for finding the optimal solution by dynamic programming. Start with t*=1:
Consider the policies of ordering at period t**, t** = 1, 2, ... , t*, and filling demands dt , t = t**, t** + 1, ... , t*, by this order
Add H(xt**)st**+itIt to the costs of acting optimally for periods 1 to t**-1 determined in the previous iteration of the algorithm
From these t* alternatives, select the minimum cost policy for periods 1 through t*
Proceed to period t*+1 (or stop if t*=N)
Because this method was perceived by some as too complex, a number of authors also developed approximate heuristics (e.
Source officielle
À propos de ce résultat
Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.