Discrete forecast horizons for two-product variants of the dynamic lot-size problem
Motivated by the recent success of integer programming based procedures for computing discrete forecast horizons, we consider two-product variants of the classical dynamic lot-size model. In the first variant, we impose a warehouse capacity constraint on the total ending inventory of the two products in any period. In the second variant, the two products have both individual and joint setup costs for production. To our knowledge, there are no known procedures for computing forecast horizons for these variants. Under the assumption that future demands are discrete, we characterize forecast horizons for these two variants as feasibility/optimality questions in 0-1 mixed integer programs. A detailed computational study establishes the effectiveness of our approach and enables us to gain valuable insights into the behavior of minimal forecast horizons.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Jaruphongsa, Wikrom & Cetinkaya, Sila & Lee, Chung-Yee, 2004. "Warehouse space capacity and delivery time window considerations in dynamic lot-sizing for a simple supply chain," International Journal of Production Economics, Elsevier, vol. 92(2), pages 169-180, November.
- Harvey M. Wagner & Thomson M. Whitin, 1958. "Dynamic Version of the Economic Lot Size Model," Management Science, INFORMS, vol. 5(1), pages 89-96, October.
- Harvey M. Wagner, 2004. "Comments on ÜDynamic Version of the Economic Lot Size ModelÝ," Management Science, INFORMS, vol. 50(12_supple), pages 1775-1777, December.
- Porras, Eric & Dekker, Rommert, 2008. "A solution method for the joint replenishment problem with correction factor," International Journal of Production Economics, Elsevier, vol. 113(2), pages 834-851, June.
- Suresh Chand & Vernon Ning Hsu & Suresh Sethi, 2002. "Forecast, Solution, and Rolling Horizons in Operations Management Problems: A Classified Bibliography," Manufacturing & Service Operations Management, INFORMS, vol. 4(1), pages 25-43, September.
- Suresh Chand & Thomas E. Morton, 1982. "A Perfect Planning Horizon Procedure for a Deterministic Cash Balance Problem," Management Science, INFORMS, vol. 28(6), pages 652-669, June.
When requesting a correction, please mention this item's handle: RePEc:eee:proeco:v:120:y:2009:i:2:p:430-436. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu)
If references are entirely missing, you can add them using this form.