Name
Abstract | ||
|---|---|---|
(This article originally appeared in Management Science, October 1958, Volume 5, Number 1, pp. 89-96, published by The Institute of Management Sciences.) A forward algorithm for a solution to the following dynamic version of the economic lot size model is given: allowing the possibility of demands for a single item, inventory holding charges, and setup costs to vary over N periods, we desire a minimum total cost inventory management scheme which satisfies known demand in every period. Disjoint planning horizons are shown to be possible which eliminate the necessity of having data for the full N periods. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1287/mnsc.1040.0262 | Management Science |
Keywords | Field | DocType |
satisfiability | Economics,Mathematical optimization,Disjoint sets,Forward algorithm,Cycle count,Operations research,Dynamic lot-size model,Total cost,Economic lot scheduling problem | Journal |
Volume | Issue | Citations |
50 | 12 Supplement | 450 |
PageRank | References | Authors |
44.47 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| H. M. Wagner | 1 | 626 | 124.38 |
| T. M. Whitin | 2 | 450 | 44.81 |