The robust multi‑plant capacitated lot‑sizing problem

• Aura Jalal ^[1] ; Aldair Alvarez ^[2] ; Cesar Alvarez Cruz ^[1] ; Jonathan De La Vega ^[3] ; Alfredo Moreno ^[4]
  1. [1] Universidade Federal de São Carlos

     Universidade Federal de São Carlos

     Brasil

     
  2. [2] HEC Montréal and GERAD, Canada
  3. [3] SimpliRoute, Chile
  4. [4] Universidad Pontifcia Bolivariana, Colombia

  Mostrar afiliaciones +
• Localización: Top, ISSN-e 1863-8279, ISSN 1134-5764, Vol. 31, Nº. 2, 2023, págs. 302-330
• Idioma: inglés
• Enlaces
  • Texto completo
• Resumen

  • In this paper, we study the robust multi-plant capacitated lot-sizing problem with uncertain demands, processing and setup times. This problem consists of a production system with more than one production plant, in which each plant can produce items to meet its demand or transfer items to other plants. The objective is to determine a minimum-cost production and transfer plan considering the compromise between production, inventory, and transfer costs. Using a static robust optimization approach, we propose two diferent robust mixed-integer programming formulations for the problem. The frst formulation applies the standard duality technique to the constraints involving uncertain parameters while the second applies the duality technique only to the time constraints and introduces new parameters, accumulating the worst-case demand realizations, to the inventory balance constraints. This second formulation has the advantage of resulting from a more intuitive and straightforward approach. We perform extensive computational experiments to compare the performance of the formulations and to assess the efect of diferent budgets of uncertainty on the solutions. Moreover, we observe that demand, processing and setup times have diferent impacts when taking uncertainty into account.