A Lagrangean relaxation algorithm for multi-item lot-sizing problems with joint piecewise linear resource costs

International Journal of Production Economics

Volumn 102, Issue 2, 2006, Pages 344-357

  Rizk, Nafee ^a   Martel, Alain ^a   Ramudhin, Amar ^b  

^a UNIVERSITÉ LAVAL   (Canada)

^b ÉCOLE DE TECHNOLOGIE SUPÉRIEURE   (Canada)

Author keywords

Discounts; Dynamic demand; Lagrangean relaxation; Mixed integer programming; Multi item lot sizing; Piecewise linear costs

Indexed keywords

COSTS; LAGRANGE MULTIPLIERS; OPTIMIZATION; PROBLEM SOLVING; PROCESS CONTROL; PURCHASING;

DISCOUNTS; DYNAMIC DEMAND; LAGRANGEAN RELAXATION; MIXED INTEGER PROGRAMMING; MULTI-ITEM LOT-SIZING; PIECEWISE LINEAR COSTS;

ALGORITHMS;

EID: 33646089649     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijpe.2005.02.015     Document Type: Article

References (27)

1. Atkins D., and Iyogun P. A heuristic with lower bound performance guarantee for the multi-product dynamic lot-size problem. IIE Transactions 20 (1988) 369-373
2. Barany I., Van Roy T., and Wolsey L. Strong formulations for multi-Item capacitated lot sizing. Management Science 30 (1984) 11255-11261
3. Bazaraa M.S., and Goode J.J. A survey of various tactics for generating lagrangian multipliers in the context of lagrangian duality. European Journal of Operational Research 3 (1979) 322-338
4. Belvaux G., and Wolsey L. Modelling practical lot-sizing problems as mixed-integer programs. Management Science 47 (2001) 993-1007
5. Bitran G., and Yanasse H. Computational complexity of the capacitated lot size problem. Management Science 28 (1982) 1174-1186
6. Buffa F., and Munn J. A recursive algorithm for order cycle-time that minimizes logistics cost. Journal of the Operational Research Society 40 (1989) 367-377
7. Cattrysse D., Maes J., and VanWassenhove L.N. Set partitioning and column generation heuristics for capacitated dynamic lot sizing. European Journal of Operational Research 46 (1990) 38-47
8. Chakravarty A. Joint inventory replenishments with group discounts based on invoice value. Management Science 30 (1984) 1105-1112
9. Diaby M., Bahl H., Karwan M., and Zionts S. Capacitated lot-sizing and scheduling by lagrangean relaxation. European Journal of Operational Research 59-3 (1992) 444-458
10. Diaby M., and Martel A. Dynamic lot-sizing in multi-echelon distribution systems with purchasing and transportation price discounts. Operations Research 41-1 (1993) 48-59
11. Fisher M.L. The Lagrangian relaxation method for solving integer programming problems. Management Science 22 (1981) 1-18
12. Gelders L., Maes J., and VanWassenhove L.N. A branch and bound algorithm for the multi-item single level capacitated dynamic lotsizing problem. In: Schneeweiss Ch., Axsater S., and Silver E. (Eds). Multi-Stage Production Planning and Inventory Control (1986), Springer, Berlin 92-108
13. Haseborg F. On the optimality of joint ordering policies in a multi-product dynamic lot size model with individual and joint set-up costs. European Journal of Operational Research 9 (1982) 47-55
14. Kao E. A multi-product dynamic lot-size model with individual and joint set-up costs. Operations Research 27 (1979) 279-289
15. Maes J., and Van Wassenhove L. Multi item single level capacitated dynamic lotsizing heuristics: a computational comparison (part I and II). IIE Transactions 18 (1986) 114-129
16. Pochet Y., and Wolsey L.A. Solving the multi-item lot-sizing problems using strong cutting planes. Management Science 37 (1991) 53-67
17. Silver E. Coordinated replenishments of items under time-varying demand: dynamic programming formulation. Naval Research Logistics Quarterly 26 (1979) 141-151
18. Silver E., and Peterson R. Decision systems for inventory management and production planning. 2nd ed (1985), Wiley, New York
19. Sox C.R., and Gao Y. The capacitated lot sizing problem with setup carry-over. IIE Transactions 31 (1999) 173-181
20. Swenseth S.R., and Godfrey M.R. Incorporating Transportation costs into inventory replenishment decisions. International Journal of Production Economics 77 (2002) 113-130
21. Thizy J., and Van Wassenhove L. Lagrangean relaxation for the multi-item capacitated lot-sizing problem: a heuristic implementation. IIE Transactions 17 (1985) 308-313
22. Trigeiro W., Thomas J., and McClain J. Capacitated lot sizing with setup times. Management Science 35 (1989) 353-366
23. van Norden L., and van de Velde S. Multi-product lot-sizing with a transportation capacity reservation contract. European Journal of Operational Research 165 (2005) 127-138
24. Veinott A.F. Minimum concave-cost solution of leontief substitution models of multi-facility inventory systems. Operations Research 17 (1969) 262-291
25. Wagner H., and Whitin T.M. Dynamic version of the economic lot size model. Management Science 5 (1958) 89-96
26. Zangwill W.I. A deterministic multiproduct, multifacility production and inventory model. Operations Research 14 (1966) 486-507
27. Zoller K., and Robrade A. Efficient heuristics for dynamic lot sizing. International Journal of Production Research 26 (1988) 249-265