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

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

0.00 Avg rating0 Votes
Article ID: iaor20128217
Volume: 53
Issue: 3
Start Page Number: 729
End Page Number: 753
Publication Date: Dec 2012
Journal: Computational Optimization and Applications
Authors: ,
Keywords: scheduling, combinatorial optimization
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.

Reviews

Required fields are marked *. Your email address will not be published.