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

Kerem Akartunali(keremacae.wisc.edu)
Andrew J. Miller(amillerengr.wisc.edu)

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 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.

Keywords: Production Planning, Integer Programming, Strong Formulations, Lagrangian Relaxation

Category 1: Applications -- OR and Management Sciences (Production and Logistics )

Citation: University of Wisconsin-Madison, Industrial and Systems Engineering, May 2007 (Submitted for publication)

Download: [PDF]

Entry Submitted: 05/28/2007
Entry Accepted: 05/29/2007
Entry Last Modified: 05/28/2007

Modify/Update this entry