Activities per year
Multi-level production planning problems in which multiple items compete for the same resources frequently occur in practice, yet remain daunting in their difficulty to solve. In this paper, we propose a heuristic framework that can generate high quality feasible solutions quickly for various kinds of lot-sizing problems. In addition, unlike many other heuristics, it generates high quality lower bounds using strong formulations, and its simple scheme allows it to be easily implemented in the Xpress-Mosel modeling language. Extensive computational results from widely used test sets that include a variety of problems demonstrate the efficiency of the heuristic, particularly for challenging problems.
- integer programming
- production planning
- strong formulations
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