A heuristic approach for big bucket multi-level production planning problems

Kerem Akartunali, Andrew Miller

Research output: Contribution to journalArticlepeer-review

84 Citations (Scopus)
70 Downloads (Pure)


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.
Original languageEnglish
Pages (from-to)396-411
Number of pages16
JournalEuropean Journal of Operational Research
Issue number2
Publication statusPublished - 1 Mar 2009


  • integer programming
  • production planning
  • heuristics
  • relax-and-fix
  • strong formulations


Dive into the research topics of 'A heuristic approach for big bucket multi-level production planning problems'. Together they form a unique fingerprint.

Cite this