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

Kerem Akartunali, Andrew Miller

Research output: Contribution to journalArticle

71 Citations (Scopus)

Abstract

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.
LanguageEnglish
Pages396-411
Number of pages16
JournalEuropean Journal of Operational Research
Volume193
Issue number2
DOIs
Publication statusPublished - 1 Mar 2009

Fingerprint

Production Planning
Heuristics
Planning
Lot Sizing
Test Set
Modeling Language
Computational Results
Lower bound
Resources
Modeling languages
Production planning
Formulation
Demonstrate

Keywords

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

Cite this

@article{5485524b738b4d9aaa691cfddff0a4fa,
title = "A heuristic approach for big bucket multi-level production planning problems",
abstract = "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.",
keywords = "integer programming, production planning, heuristics, relax-and-fix, strong formulations",
author = "Kerem Akartunali and Andrew Miller",
year = "2009",
month = "3",
day = "1",
doi = "10.1016/j.ejor.2007.11.033",
language = "English",
volume = "193",
pages = "396--411",
journal = "European Journal of Operational Research",
issn = "0377-2217",
number = "2",

}

A heuristic approach for big bucket multi-level production planning problems. / Akartunali, Kerem; Miller, Andrew.

In: European Journal of Operational Research, Vol. 193, No. 2, 01.03.2009, p. 396-411.

Research output: Contribution to journalArticle

TY - JOUR

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

AU - Akartunali, Kerem

AU - Miller, Andrew

PY - 2009/3/1

Y1 - 2009/3/1

N2 - 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.

AB - 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.

KW - integer programming

KW - production planning

KW - heuristics

KW - relax-and-fix

KW - strong formulations

U2 - 10.1016/j.ejor.2007.11.033

DO - 10.1016/j.ejor.2007.11.033

M3 - Article

VL - 193

SP - 396

EP - 411

JO - European Journal of Operational Research

T2 - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 2

ER -