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

Tools

Akartunali, Kerem and Miller, Andrew J. (2012) A computational analysis of lower bounds for big bucket production planning problems. Computational Optimization and Applications, 53 (3). pp. 729-753. ISSN 0926-6003 (https://doi.org/10.1007/s10589-012-9465-z)

[thumbnail of LB_Paper_COAP_final_authorVersion.pdf]
Preview
 PDF. Filename: LB_Paper_COAP_final_authorVersion.pdf
Accepted Author Manuscript
Download (189kB)| Preview

Abstract

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.

ORCID iDs

Akartunali, Kerem ORCID logoORCID: https://orcid.org/0000-0003-0169-3833 and Miller, Andrew J.;
CORE (COnnecting REpositories)