MILLER, Andrew J.; AKARTUNALI, Kerem

doi:10.1007/s10589-012-9465-z

Metadatos

Licencia de uso del documento

MILLER, Andrew J.
Institut de Mathématiques de Bordeaux [IMB]
Reformulations based algorithms for Combinatorial Optimization [Realopt]

AKARTUNALI, Kerem
Department of Management Science [Univ Strathclyde]

Idioma

Article de revue

Este ítem está publicado en

Computational Optimization and Applications. 2012, vol. 53, n° 3, p. 729-753

Springer Verlag

Resumen en inglés

In this paper, we analyze a variety of approaches to obtain lower bounds for multi-level 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 provide crucial insights on why these problems are hard to solve, and this is addressed by a thorough analysis in the paper. We conclude with computational results on a variety of widely used test sets, and a discussion of future research.< Leer menos

Metadatos

Compartir este ítem

Licencia de uso del documento

A computational analysis of lower bounds for big bucket production planning problems

Idioma

Este ítem está publicado en

Resumen en inglés

URI

DOI

Orígen

Centros de investigación