Abstract
Abstract This paper addresses the capacitated lot sizing problem (CLSP) with a single stage composed of multiple plants, items and periods with setup carry-over among the periods. The CLSP is well studied and many heuristics have been proposed to solve it. Nevertheless, few researches explored the multi-plant capacitated lot sizing problem (MPCLSP), which means that few solution methods were proposed to solve it. Furthermore, to our knowledge, no study of the MPCLSP with setup carry-over was found in the literature. This paper presents a mathematical model and a GRASP (Greedy Randomized Adaptive Search Procedure) with path relinking to the MPCLSP with setup carry-over. This solution method is an extension and adaptation of a previously adopted methodology without the setup carry-over. Computational tests showed that the improvement of the setup carry-over is significant in terms of the solution value with a low increase in computational time.
Highlights
The capacitated lot sizing problem (CLSP) is a tactical production problem which consists in deciding when and how many items to produce minimizing the production costs assuring the demand constraints
This paper presents a mathematical model and a GRASP heuristic embedded with a path relinking strategy to approximately solve the multi-plant capacitated lot sizing problem (MPCLSP) with multiple items and multiple periods
In this paper we presented a novel mathematical formulation to the MPCLSP with setup carry-over
Summary
The capacitated lot sizing problem (CLSP) is a tactical production problem which consists in deciding when and how many items to produce minimizing the production costs assuring the demand constraints. There are many approaches for the CLSP with a single item, with multiple items and with only one or multiple production centers These problems are tackled heuristically [24, 12, 5], though exact solution methods exist to solve them [4], [19] and [2]. The multi-plant capacitated lot sizing problem (MPCLSP) with multiple items and periods is composed of multiple production centers that produce all the same items as well as enabling transfers amongst the plants. This paper presents a mathematical model and a GRASP heuristic embedded with a path relinking strategy to approximately solve the MPCLSP with multiple items and multiple periods. Computational tests indicate that the setup carry-over showed good performance for both the single-plant and the multi-plant problems with a slight increase of computational time in the latter case In both cases the strategy achieved better solutions for all instances.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
