 |
 |
 |
|
|
|
| HAL: hal-00387105, version 1 |
| Detailed view |  Export this paper |
 |
|
|
| A Computational Analysis of Lower Bounds for Big Bucket Production Planning Problems |
|
|
| Kerem Akartunali 1Andrew J. Miller 2, 3 |
|
|
| (2009-05-24) |
|
|
|
| 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. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Department of Mathematics and Statistics [Melbourne] |
|
|
|
University of Melbourne |
|
|
| 2: | Institut de Mathématiques de Bordeaux (IMB) |
|
|
|
CNRS : UMR5251 – Université Sciences et Technologies - Bordeaux I – Université Victor Segalen - Bordeaux II |
|
|
| 3: | RealOpt (INRIA Bordeaux - Sud-Ouest) |
|
|
|
INRIA – Université Sciences et Technologies - Bordeaux I – Université Victor Segalen - Bordeaux II – CNRS : UMR – École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB) |
|
|
|
|
|
|
|
|
|
| Subject | : | Computer Science/Operations Research |
|
|
| Attached file list to this document: | |||||
|
|||||
|
|
|
| hal-00387105, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00387105 | |
| oai:hal.archives-ouvertes.fr:hal-00387105 | |
| From: Andrew J. Miller | |
| Submitted on: Sunday, 24 May 2009 01:30:10 | |
| Updated on: Sunday, 24 May 2009 07:20:13 | |
