Activities per year
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.
- production planning
- integer programming
- strong formulations
- Lagrangian relaxation
FingerprintDive into the research topics of 'A computational analysis of lower bounds for big bucket production planning problems'. Together they form a unique fingerprint.
- 1 Key-note speaker and plenary lectures at conferences
18th ONPCE (National Workshop on Problems of Cutting and Packing, Planning and Production Scheduling)
Kerem Akartunali (Participant)7 Nov 2017
Activity: Participating in or organising an event types › Key-note speaker and plenary lectures at conferences