Article ID: | iaor2017133 |
Volume: | 63 |
Issue: | 8 |
Start Page Number: | 647 |
End Page Number: | 666 |
Publication Date: | Dec 2016 |
Journal: | Naval Research Logistics (NRL) |
Authors: | Guan Yongpei, Richard Jean-Philippe P, Arslan Aye N |
Keywords: | combinatorial optimization, graphs, production, planning, heuristics |
In this article, we study a two‐level lot‐sizing problem with supplier selection (LSS), which is an NP‐hard problem arising in different production planning and supply chain management applications. After presenting various formulations for LSS, and computationally comparing their strengths, we explore the polyhedral structure of one of these formulations. For this formulation, we derive several families of strong valid inequalities, and provide conditions under which they are facet‐defining. We show numerically that incorporating these valid inequalities within a branch‐and‐cut framework leads to significant improvements in computation.