This article illustrates an improvement of the traditional MRP algorithm, providing significant benefits in terms of reducing the nervous behavior, better pacing order releases, lowering inventory and concurrently reducing the need for continuous forecast adjustments. The proposed algorithm uses the same set of MRP formulas but refers to a L4L continuous replenishment / production routine, anyway succeeding in releasing batch orders according to EOQ and/or POQ criteria. Simulations have been performed on a three-echelon supply chain in order to test the algorithm effectiveness, either in case of stable but stochastic demand or in case of sudden surges.
D'Avino, M., Bregni, A., Schiraldi, M.m. (2013). A Revised and improved version of the MRP algorithm: Rev MRP. In Y. Wang (a cura di), Mechanical science and engineering 3. (pp. 276-280). Scientific.net [10.4028/www.scientific.net/AMM.328.276].
A Revised and improved version of the MRP algorithm: Rev MRP
SCHIRALDI, MASSIMILIANO MARIA
2013-01-01
Abstract
This article illustrates an improvement of the traditional MRP algorithm, providing significant benefits in terms of reducing the nervous behavior, better pacing order releases, lowering inventory and concurrently reducing the need for continuous forecast adjustments. The proposed algorithm uses the same set of MRP formulas but refers to a L4L continuous replenishment / production routine, anyway succeeding in releasing batch orders according to EOQ and/or POQ criteria. Simulations have been performed on a three-echelon supply chain in order to test the algorithm effectiveness, either in case of stable but stochastic demand or in case of sudden surges.| File | Dimensione | Formato | |
|---|---|---|---|
|
187428.pdf
accesso aperto
Dimensione
527.85 kB
Formato
Adobe PDF
|
527.85 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
