|
| << vorige | volgende >> |
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
Details van artikel 6 van 11 gevonden artikelen
| Titel: |
A Study of Lot Sizing Algorithms |
| Auteur: |
Karni, Reuven |
| Verschenen in: |
IIE transactions |
| Paginering: | Jaargang 18 (1986) nr. 4 pagina's 356-366 |
| Jaar: |
1986-12-01 |
| Inhoud: |
The many MRP lot-sizing algorithms proposed imply four underlying time-phasing requirements: minimizing inventory, maintaining uniform batch sizes, maintaining regular order cycles, and attaining minimum costs. This study examines the cost behavior of four exact and two classical algorithms addressing these structures. Several parameters, describing the demand profile, planning horizon and component costs enable effective evaluation and prediction of cost behaviour. The study shows that: (1) imposing regularity constraints on an MRP schedule leads to costs 14% above the minimum for fixed batch sizing, and 2% for regular order cycling; (2) fixed order cycle schedules show costs close to the minimum attainable, thus supporting the use of this approach in practice; (3) the classical POQ schedules also show good cost performance (11% above minimum); and (4) the cost behaviour of a wide range of MRP demand profiles and cost components can be fairly well predicted (to 7% on the average) using simplified “ideal” relationships. |
| Uitgever: |
Taylor & Francis |
| Bronbestand: |
Elektronische Wetenschappelijke Tijdschriften |
Details van artikel 6 van 11 gevonden artikelen
| << vorige | volgende >> |