A Computational Analysis of Lower Bounds for Big Bucket Production Planning Problems

Kerem Akartunali 1 Andrew J. Miller 2, 3
3 Realopt - Reformulations based algorithms for Combinatorial Optimization
LaBRI - Laboratoire Bordelais de Recherche en Informatique, IMB - Institut de Mathématiques de Bordeaux, Inria Bordeaux - Sud-Ouest
Abstract : In this paper, we analyze a variety of approaches to obtain lower bounds for multilevel production planning problems with big bucket capacities, i.e., problems in which multiple items compete for the same resources. We give an extensive survey of both known and new methods, and also establish relationships between some of these methods that, to our knowledge, have not been presented before. As will be highlighted, understanding the substructures of difficult problems provides valuable insights on why these problems are hard to solve. We conclude with computational results from widely used test sets and discussion of future research.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [45 references]  Display  Hide  Download

Contributor : Andrew J. Miller <>
Submitted on : Sunday, May 24, 2009 - 1:30:10 AM
Last modification on : Thursday, January 11, 2018 - 6:22:12 AM
Long-term archiving on : Thursday, June 10, 2010 - 9:44:49 PM


Files produced by the author(s)


  • HAL Id : hal-00387105, version 1


Kerem Akartunali, Andrew J. Miller. A Computational Analysis of Lower Bounds for Big Bucket Production Planning Problems. 2009. ⟨hal-00387105⟩



Record views


Files downloads