Efficient reformulations for dynamic lot-sizing problems with product substitution

Springer Science and Business Media LLC - Tập 32 - Trang 263-291 - 2008
Jan Christian Lang1, Wolfgang Domschke1
1Chair of Operations Research, Institute of Business Administration, Technische Universität Darmstadt, Darmstadt, Germany

Tóm tắt

We consider single-level uncapacitated and capacitated lot-sizing problems with product substitution, where products may be substituted by certain other products to satisfy demand. The models incorporate initial inventories and general substitution structures. We formulate the problems as mixed-integer linear programs and develop Simple Plant Location-based reformulations as well as new valid inequalities. Computational results on generated problem instances show that the reformulations are superior to the original formulations and those with valid inequalities added a priori, except for instances with multiple resources and downward substitution. In most cases, the running times of a mixed-integer programming solver on approximate extended formulations that only contain a subset of the disaggregated constraints were almost as good as on complete Simple Plant Location-based reformulations.

Tài liệu tham khảo

Aissaoui N, Haouari M, Hassini E (2007) Supplier selection and order lot sizing modeling: a review. Comput Oper Res 34(12): 3516–3540 Alfieri A, Brandimarte P, D’Orazio S (2002) LP-based heuristics for the capacitated lot-sizing problem: the interaction of model formulation and solution algorithm. Int J Prod Res 40(2): 441–458 Archibald TW (2007) Modelling replenishment and transshipment decisions in periodic review multilocation inventory systems. J Oper Res Soc 58(7): 948–956 Axsäter S (2006) Inventory control. International Series in Operations Research and Management Science, 2nd edn. Springer, Berlin Balakrishnan A, Geunes J (2000) Requirements planning with substitutions: exploiting bill-of-materials flexibility in production planning. Manuf Serv Oper Manage 2(2): 166–185 Balakrishnan A, Geunes J (2003) Production planning with flexible product specifications: an application to specialty steel manufacturing. Oper Res 51(1): 94–112 Bassok Y, Anupindi R, Akella R (1999) Single-period multiproduct inventory models with substitution. Oper Res 47(4): 632–642 Belvaux G, Wolsey LA (2001) Modelling practical lot-sizing problems as mixed-integer programs. Manage Sci 47(7): 993–1007 Bitran GR, Dasu S (1992) Ordering policies in an environment of stochastic yields and substitutable demands. Oper Res 40(5): 999–1017 Bowman E (1956) Production scheduling by the transportation method of linear programming. Oper Res 4(1): 100–103 Denizel M, SüralH (2006) On alternative mixed integer programming formulations and LP-based heuristics for lot-sizing with setup times. J Oper Res Soc 57(4):389–399 Denton B, Gupta D (2004) Strategic inventory deployment in the steel industry. IIE Trans 36(11): 1083–1097 Duenyas IP, Tsai CYP (2000) Control of a manufacturing system with random product yield and downward substitutability. IIE Trans 32(9): 785–795 Erlenkotter D (1978) A dual-based procedure for uncapacitated facility location. Oper Res 26(6): 992–1009 Ettl M, Huang P, Sourirajan K, Ervolina TR, Lin GY (2006) Supply and demand synchronization in assemble-to-order supply chains. Tech. Rep., IBM Research Report, RC 23923 Gallego G, Katircioglu K, Ramachandran B (2006) Semiconductor inventory management with multiple grade parts and downgrading. Prod Plann Control 17(7): 689–700 Gallego G, Phillips R (2004) Revenue management of flexible products. Manuf Serv Oper Manage 6(4): 321–337 Gerchak Y, Grosfeld-Nir A (1999) Lot-sizing for substitutable, production-to-order parts with random functionality yields. Int J Flexible Manuf Syst 11(4): 371–377 Geunes J (2003) Solving large-scale requirements planning problems with component substitution options. Comput Ind Eng 44(3): 475–491 Hale W, Pyke DFP, Rudi N (2000) An assemble-to-order system with component substitution. Tech. Rep., The Amos Tuck School, Dartmouth College, Hanover/The Simon School, University of Rochester, Rochester Hsu A, Bassok Y (1999) Random yield and random demand in a production system with downward substitution. Oper Res 47(2): 277–290 Hsu VN, Li CL, Xiao WQ (2005) Dynamic lot size problems with one-way product substitution. IIE Trans 37: 201–215 Jones PC, Lowe TJ, Muller G, Xu N, Ye Y, Zydiak JL (1995) Specially structured uncapacitated facility location problems. Oper Res 43(4): 661–669 Karaesmen I, Ryzin G (2004) Overbooking with substitutable inventory classes. Oper Res 52(1): 83–104 Krarup J, Bilde O (1977) Plant location, set covering and economic lot size: an O(mn)-algorithm for structured problems. In: Collatz L, Meinardus G, Wetterling W (eds) Numerische Methoden bei Optimierungsaufgaben, Band 3: Optimierung bei graphentheoretischen und ganzzahligen Problemen. Birkhäuser, Basel, pp 155–180 Liu J, Lee CG (2007) Evaluation of inventory policies with unidirectional substitutions. Eur J Oper Res 182: 145–163 Maes J, McClain J, Van Wassenhove L (1991) Multilevel capacitated lotsizing complexity and LP-based heuristics. Eur J Oper Res 53(2): 131–148 Minner S, Silver EA, Robb DJ (2003) An improved heuristic for deciding on emergency transshipments. Eur J Oper Res 148(2): 384–400 Ng KYK, Lam MN (1998) Standardisation of substitutable electrical items. J Oper Res Soc 49(9): 992–997 Pentico DW (1988) The discrete two-dimensional assortment problem. Oper Res 36(2): 324–332 Pentico DW (2008) The assortment problem: a survey. Eur J Oper Res 190(2): 295–309 Pochet Y, Wolsey L (2006) Production planning by mixed integer programming. Springer, Berlin Rao UN, Swaminathan JN, Zhang J (2004) Multi-product inventory planning with downward substitution, stochastic demand and setup costs. IIE Trans 36(1): 59–71 Sadowski W (1959) A few remarks on the assortment problem. Manage Sci 6(1): 13–24 Shumsky RA, Zhang F (2007) Dynamic capacity management with substitution. Tech. Rep., Tuck School of Business, Dartmouth University Sridharan R (1995) The capacitated plant location problem. Eur J Oper Res 87(2): 203–213 Stadtler H (1996) Mixed integer programming model formulations for dynamic multi-item multi-level capacitated lotsizing. Eur J Oper Res 94(3): 561–581 Stadtler H (1997) Reformulations of the shortest route model for dynamic multi-item multi-level capacitated lotsizing. OR Spectr 19(2): 87–96 Vyve MV, Wolsey LA (2006) Approximate extended formulations. Math Program 105(2): 501–522 Wolsey LA (2003) Strong formulations for mixed integer programs: valid inequalities and extended formulations. Math Program 97(1): 423–447 Yao DD, Zheng S (2003) Stochastic modeling and optimization of manufacturing systems and supply chains, chap. 8. In: Inventory with substitution: single- and multi-period models. Kluwer, Boston, pp 177–202