Langrangian Relaxation of Multi Level Capacitated Lot Sizing Problem with Consideration of Lead Time

Hanaa Razki, Ahmed Moussa

2017

Abstract

Tactical planning consists to develop production plans by determining the quantities of products manufactured by period to best meet customer demand at lower costs. This issue has been widely discussed, according to two criteria: multi level and single level planning. The concept of multi level reflects well the manufacturing structure. For this, we propose in this work a new mathematical model of lot sizing finite capacity (Multi Level Capacitated Lot Sizing Problem) based on Lagrangian relaxation optimization approach. Comparisons of this new model with traditional one demonstrate the efficiency of this new approach as well in simulated case as real situations. The generated production plans are optimal with 68% -98% compared to classical models.

References

  1. Comelli, M., M. Gourgand et D. Lemoine, 2008. A review of tactical planning models, Journal of Systems Science and Systems Engineering, Vol.17(2), pp 204- 229.
  2. Almeder,C.,&Almada-Lobo,B.(2011). Synchronization of scarce resources for a parallel machine lot sizing problem. International Journal of Production Research, 49(24),7315-7335.
  3. Berretta, R., Franca, P., Armentano, V., 2005. Metaheuristic approaches for the multilevel resourceconstraint lot-sizing problem with setup and lead times. Asia - Pacific Journal of Operational Research 22 (2), 261-286.
  4. Chen, H. et Chu, C. (2003). A lagrangian relaxation approach for supply chain planning with order/ setup costs and capacity constraints, Journal of System Science and Systems Engineering.
  5. Nascimento, M. C. V., M. C. G. Resende, and F. M. B. Toledo (2010). GRASP with path-relinking for the multi-plant capacitated lot sizing problem. European Journal of Operational Research 200, 747-754.
  6. Buschkuhl, L., F. Sahling, S. Helber, and H. Tempelmeier (2008). Dynamic capacitated lot sizing a classification and review of the literature on \big bucket" problems.
  7. [Bel 1998] Bel G., Aide à la conception et à la conduite de systèmes à événements discrets : Application aux systèmes de production, Habilitation à diriger des recherches, Université Paul Sabatier, Toulouse, Mai 1998.
  8. Tempelmeier, H., Buschkühl, L., 2008. Dynamic multimachine lotsizing and sequencing with simultaneous scheduling of a common setup resource. International Journal of Production Economics 113, 401-412.
  9. Buschkühl, L., Sahling, F., Helber, S., Tempelmeier, H., 2010. Dynamic capacitated lot-sizing problems: a classification and review of solution approaches. OR Spectrum 32, 231-261.
  10. C. Almeder, R.Traxler al. 2014, Lead time considerations for the multi-level capacitated lot-sizing problem, European Journal of Operational Research 000 (2014) 1-12.
  11. Sambasivan, M. and C. P. Schimidt (2002). A heuristic procedure for solving multi-plant, multi-item, multiperiod capacited lot-sizing problems. Asia Pacific Journal of Operational Research 19, 87-105.
  12. IBM ILOG AMPL, Version 12.2. User's Guide Standard (Command-line) Version Including CPLEX Directives. May 2010.
  13. Fisher, M. L. (2004). The lagrangian relaxation method for solving integer programming problems. Management science 50 (12 supplement), 1861-1871.
  14. Wu, T., C. Zhang, Z. Liang, and S. C. Leung (2013). A lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders. Computers & Operations Research 40, 1852-1863.
  15. Toledo, C. F. M., L. de Oliveira, R. de Freitas Pereira, P. M. Fran¸ca, and R. Morabito (2014). A genetic algorithm/mathematical programming approach to solve a two-level soft drink production problem. Computers &Operations Research 48, 40-52.
  16. Nascimento, M. C. V., M. C. G. Resende, and F. M. B. Toledo (2010). GRASP with path-relinking for the multi-plant capacitated lot sizing problem. European Journal of Operational Research 200, 747-754.
  17. Berretta, R., Franca, P., Armentano, V., 2005. Metaheuristic approaches for the multilevel resourceconstraint lot-sizing problem with setup and lead times. Asia - Pacific Journal of Operational Research 22 (2), 261-286.
  18. Sambasivan, M. and S. Yahya (2005). A lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers. Computers and Operations Research 32, 537-555.
  19. Almeder,C.(2010). A hybrid optimization approach formulation level capacitated lot sizing problems. European Journal of Operational Research, 200,599- 606
Download


Paper Citation


in Harvard Style

Razki H. and Moussa A. (2017). Langrangian Relaxation of Multi Level Capacitated Lot Sizing Problem with Consideration of Lead Time . In Doctoral Consortium - DCORES, ISBN , pages 12-19


in Bibtex Style

@conference{dcores17,
author={Hanaa Razki and Ahmed Moussa},
title={Langrangian Relaxation of Multi Level Capacitated Lot Sizing Problem with Consideration of Lead Time},
booktitle={Doctoral Consortium - DCORES,},
year={2017},
pages={12-19},
publisher={SciTePress},
organization={INSTICC},
doi={},
isbn={},
}


in EndNote Style

TY - CONF
JO - Doctoral Consortium - DCORES,
TI - Langrangian Relaxation of Multi Level Capacitated Lot Sizing Problem with Consideration of Lead Time
SN -
AU - Razki H.
AU - Moussa A.
PY - 2017
SP - 12
EP - 19
DO -