Ending Inventory Valuation in Multiperiod Production Scheduling

References

• Aggarwal A., Park J. K. Improved algorithms for economic lot size problems. Oper. Res. (1993) 41:549–571Link, Google Scholar
• Baker K. R., Dixon P., Magazine M. J., Silver E. A. An algorithm for the dynamic lot size problem with time-varying production capacity constraints. Management Sci. (1978) 24:1710–1720Link, Google Scholar
• Bitran G., Matsuo H. The multi item capacitated lot size problem: Error bounds of Manne's formulation. Management Sci. (1986) 32:350–359Link, Google Scholar
• Blackburn J. D., Millen R. A. Heuristic lot sizing performance in a rolling-schedule environment. Decision Sci. (1980) 11:691–701Crossref, Google Scholar
• Carr C.R., Howe C.W. Optimal service policies and finite time horizons. Management Sci. (1962) 9(1):126–140Link, Google Scholar
• Chand S., Sethi S., Sorger G. Forecast horizons in the discounted dynamic lot size model. Management Sci. (1992) 38:1034–1048Link, Google Scholar
• Chen H.-D., Hearn D. W., Lee C.-Y. Minimizing the error bound for the dynamic lot size model. Oper. Res. Letters (1995) 17:57–68Crossref, Google Scholar
• Eppen G. D., Gould F. J., Pashigian B. P. Extensions of planning horizon theorem in the dynamic lot size model. Management Sci. (1969) 15:268–277Link, Google Scholar
• Federgruen A., Tzur M. A simple forward algorithm to solve general dynamic lot sizing models in O(nlogn) or O(n) time. Management Sci. (1991) 37:909–925Link, Google Scholar
• Federgruen A., Tzur M. Minimal forecast horizons and a new planning procedure for the general dynamic lot sizing model: Nervousness revisited. Oper. Res. (1994) 42:456–468Link, Google Scholar
• Grinold R. C. Model building techniques for the correction of end effects in multistage convex programs. Oper. Res. (1983) 31:407–431Link, Google Scholar
• Lee C. Y., Denardo E. V. Rolling planning horizons: Error bounds for the dynamic lot size model. Math. Oper. Res. (1986) 11:423–432Link, Google Scholar
• Lundin R. A., Morton T. E. Planning horizons for the dynamic lot size model: Zabel vs. protective procedures and computational results. Oper. Res. (1975) 23:711–734Link, Google Scholar
• Maes J., Van Wassenhove L. N. Multi item single level capacitated dynamic lot sizing heuristics: A computational comparison. IIE Trans. (1986) 124–129Google Scholar
• Silver E. A., Meal H. C. A heuristic selecting lot size requirements for the case of a deterministic time-varying demand rate and discrete opportunities for replenishment. Production and Inventory Management (1973) 14:64–77Google Scholar
• Trigeiro W. W., Thomas L. J., McClain J. O. Capacitated lot sizing with setup times. Management Sci. (1989) 35(3):353–366Link, Google Scholar
• Vachani R. Performance of heuristics for the uncapacitated lot size problem. Naval Res. Logist. (1992) 39:801–813Crossref, Google Scholar
• Wagelmans A., Van Hoesel S., Kolen A. Economic lot sizing: An O(n log n) algorithm that runs in linear time in the Wagner Whitin case. Oper. Res. (1992) 40:8145–8156Link, Google Scholar
• Wagner H. M., Whitin T. M. Dynamic version of the economic lot size model. Management Sci. (1958) 5:89–96Link, Google Scholar
• Zabel E. Some generalization of inventory planning horizon theorem. Management Sci. (1964) 10:465–471Link, Google Scholar