An improved heuristic for the capacitated lot-sizing problem

DOI10.1504/IJOR.2010.029519MaRDI QIDQ1042705zbMATH OpenFDO

Authors J. Blot

Publication date 7 December 2009

Published in International Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1504/IJOR.2010.029519

zbMATH Keywords

capacitated lot sizingfixed charge transportationheuristicsmixed integer programmingproduction planning

Mathematics Subject Classification ID

Production models (90B30) Approximation methods and heuristics in mathematical programming (90C59)

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.

Recommendations

• An effective heuristic for the CLSP with set-up times
• Multi-Item Single-Level Capacitated Dynamic Lot-Sizing Heuristics: A General Review
• Solving the capacitated lot-sizing problem with backorder consideration
• The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times
• The capacitated lot-sizing problem with linked lot sizes

Cited in

(10)

• A simple heuristic for the multi-item single level capacitated lotsizing problem
• Designing new heuristics for the capacitated lot sizing problem by genetic programming
• A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing
• Worst case analysis of relax and fix heuristics for lot-sizing problems
• Solving large-scale profit maximization capacitated lot-size problems by heuristic methods
• Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem
• A heuristic procedure for the capacitated lot sizing problem with setup carry-over
• The capacitated lot-sizing problem with linked lot sizes
• LP-based heuristics for the capacitated lot-sizing problem: The interaction of model formulation and solution algorithm
• An effective heuristic for the CLSP with set-up times

This page was built for publication: An improved heuristic for the capacitated lot-sizing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1042705)