A Computational Analysis of Lower Bounds for Big Bucket Production Planning Problems
MILLER, Andrew J.
Institut de Mathématiques de Bordeaux [IMB]
Reformulations based algorithms for Combinatorial Optimization [Realopt]
Institut de Mathématiques de Bordeaux [IMB]
Reformulations based algorithms for Combinatorial Optimization [Realopt]
MILLER, Andrew J.
Institut de Mathématiques de Bordeaux [IMB]
Reformulations based algorithms for Combinatorial Optimization [Realopt]
< Réduire
Institut de Mathématiques de Bordeaux [IMB]
Reformulations based algorithms for Combinatorial Optimization [Realopt]
Langue
en
Document de travail - Pré-publication
Résumé en anglais
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 ...Lire la suite >
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.< Réduire
Origine
Importé de halUnités de recherche