Local Cuts and Two-Period Convex Hull Closures for Big Bucket Lot-Sizing Problems.

Kerem Akartunali (1) , Andrew J. Miller (2, 3)

1 Department of Management Science [Univ Strathclyde]
2 IMB - Institut de Mathématiques de Bordeaux
3 Realopt - Reformulations based algorithms for Combinatorial Optimization

Despite the significant attention that they have drawn over the years, big bucket lot-sizing problems remain notoriously difficult to solve. The authors have previously presented evidence that what make these problems difficult are the embedded single-machine, single-level, multi-period submodels. We therefore consider the simplest such submodel, a multi-item, two-period capacitated model.

Domaines: Recherche opérationnelle [math.OC]

Kerem Akartunali, Andrew J. Miller. Local Cuts and Two-Period Convex Hull Closures for Big Bucket Lot-Sizing Problems.. ROADEF 2010: 11e congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, Feb 2010, France. http://spiderman-2.laas.fr/roadef2010/actes/. ⟨hal-00547807⟩