Strathprints logo
Strathprints Home | Open Access | Browse | Search | User area | Copyright | Help | Library Home | SUPrimo

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

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

[img]
Preview
PDF
LB_Paper_COAP_final_authorVersion.pdf - Submitted Version

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.

Item type: Article
ID code: 39630
Keywords: production planning, lot-sizing, integer programming, strong formulations, Lagrangian relaxation, Management. Industrial Management, Control and Optimization, Computational Mathematics, Applied Mathematics
Subjects: Social Sciences > Industries. Land use. Labor > Management. Industrial Management
Department: Strathclyde Business School > Management Science
Depositing user: Pure Administrator
Date Deposited: 09 May 2012 13:15
Last modified: 21 May 2015 14:33
URI: http://strathprints.strath.ac.uk/id/eprint/39630

Actions (login required)

View Item View Item