The Capacitated Lot-Sizing Problem with Linked Lot Sizes
Management Science
Computers and Operations Research
Production Planning by Mixed Integer Programming (Springer Series in Operations Research and Financial Engineering)
Capacitated lot sizing with linked lots for general product structures in job shops
Computers and Industrial Engineering
Computers and Operations Research
A math-heuristic for the multi-level capacitated lot sizing problem with carryover
EvoCOMNET'10 Proceedings of the 2010 international conference on Applications of Evolutionary Computation - Volume Part II
Integrated pulp and paper mill planning and scheduling
Computers and Industrial Engineering
Journal of Global Optimization
Computers and Operations Research
A MIP-based framework and its application on a lot sizing problem with setup carryover
Journal of Heuristics
Discrete Event Dynamic Systems
A hybrid compact genetic algorithm applied to the multi-level capacitated lot sizing problem
Proceedings of the 28th Annual ACM Symposium on Applied Computing
A hybrid cGA applied to the MLCLSP with overtime
ACM SIGAPP Applied Computing Review
Hi-index | 0.01 |
This paper presents a new algorithm for the dynamic multi-level capacitated lot sizing problem with setup carry-overs (MLCLSP-L). The MLCLSP-L is a big-bucket model that allows the production of any number of products within a period, but it incorporates partial sequencing of the production orders in the sense that the first and the last products produced in a period are determined by the model. We solve a model which is applicable to general bill-of-material structures and which includes minimum lead times of one period and multi-period setup carry-overs. Our algorithm solves a series of mixed-integer linear programs in an iterative so-called fix-and-optimize approach. In each instance of these mixed-integer linear programs a large number of binary setup variables is fixed whereas only a small subset of these variables is optimized, together with the complete set of the inventory and lot size variables. A numerical study shows that the algorithm provides high-quality results and that the computational effort is moderate.