An improved heuristic for the capacitated lot-sizing problem
type: Item
instance of: scholarly article
title: An improved heuristic for the capacitated lot-sizing problem
zbMATH Open document ID: 1176.90174
DOI: 10.1504/IJOR.2010.029519
author: J. Blot
published in: International Journal of Operational Research
publication date: 2009-12-07T00:00:00Z
review text: Summary: We present a heuristic for the Capacitated Lot-Sizing (CLS) problem without set-up time considerations and no backordering option. The CLS problem is formulated as a mixed integer-programming problem with an underlying fixed charge transportation problem structure. This formulation is flexible enough to handle different types of production capacity such as regular time capacity, overtime capacity and subcontracting. A heuristic that exploits the fixed charge transportation structure and trade-offs involved in lot-sizing decisions is developed for the problem. We also present a new Lower Bound Procedure for the multi-item CLS problems. We demonstrate the performance of the heuristic over a variety of test problems. The heuristic is evaluated by comparing the solution values to the lower bound values as well as to the solution values from another algorithm for similar problems.
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5643187
zbMATH Keywords: heuristics
zbMATH Keywords: capacitated lot sizing
zbMATH Keywords: production planning
zbMATH Keywords: mixed integer programming
zbMATH Keywords: fixed charge transportation
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 5643187