MULTILEVEL CAPACITATED LOTSIZING COMPLEXITY AND LP-BASED HEURISTICS

doi:10.1016/0377-2217(91)90130-N

MULTILEVEL CAPACITATED LOTSIZING COMPLEXITY AND LP-BASED HEURISTICS

1991-07-01

164

PRE

AI

DOI：10.1016/0377-2217(91)90130-N

Original

Original request for help

Save

Abstract

En 中文

This paper presents the first heuristics capable of solving multilevel lotsizing problems with capacity constraints on more than one level. Moreover, the form of the heuristics is quite general so that they can easily be extended to solve a variety of problems. If one wants to solve these problems on a routine basis in a real environment one needs to find fast and easy algorithms. However, we show that for certain problem classes this is a very difficult task, far more difficult than has been suggested in the literature. For problems with setup times we show that finding a feasible solution is NP-complete. Even without setup times testing for feasibility can be very difficult. Just how time consuming such heuristics must be is demonstrated. This leaves little chance to build fast and easy heuristics except for the most simple cases. Our exploration of the complexity issues points to mathematical programming as a potential source of heuristics for these problems. This paper presents a new and general approach based on rounding an LP solution for the problem without setup times. The methods use different information and patterns evident in the LP solution are explored. The approach is tested on a large set of problems. The main contributions of this paper are the way in which we distinguish between the easy and hard lotsizing problems, the LP-based heuristics and the test set of capacitated multilevel lotsizing problems.

Keywords:

PRODUCTION PLANNING

LINEAR PROGRAMMING

HEURISTICS

MULTILEVEL CAPACITATED LOTSIZING COMPLEXITY AND LP-BASED HEURISTICS

Abstract

AI Summary

Journal

Organization