Journal ArticleDOI
A note on modelling the capacitated lot-sizing problem with set-up carryover and set-up splitting
TLDR
In this paper, the capacitated lot sizing problem with set-up carryover and setup splitting (CLSP-SCSS) is formulated as a mixed integer linear program.Abstract:
The capacitated lot-sizing problem with set-up carryover and set-up splitting (CLSP-SCSS) is formulated as a mixed integer linear program. We define set-up carryover as the production of a product that is continued over from one period to another without incurring an extra set-up. Set-up splitting occurs when the set-up for a product is started at the end of a period and completed at the beginning of the next period. We allow product dependent set-ups. Initial experimentation highlights the importance of including set-up splitting in the CLSP model. In 12 out of the 18 problem instances tested, our model yielded better solutions or removed infeasibility when compared with a CLSP model without set-up splitting.read more
Citations
More filters
Posted Content
The capacitated lot-sizing problem with linked lot-sizes
TL;DR: In this paper, a new mixed integer programming (MIP) model formulation and its incorporation into a time-oriented decomposition heuristic for the capacitated lot-sizing problem with linked lot sizes (CLSPL) is proposed.
Journal ArticleDOI
Impact analysis of setup carryover and crossover on lot sizing problems
TL;DR: A literature classification and a detailed computational study analysing the impact of considering the possibility of setup carryover and crossover when solving the lot sizing problem are presented.
Journal ArticleDOI
A comparison of mixed integer programming formulations of the capacitated lot-sizing problem
TL;DR: The authors' experiments demonstrate that, while the S&S formulation provides a much tighter LP bound, the Novel formulation is better able to exploit the intelligence of the CPLEX solution engine.
Dissertation
Optimisation intégrée des décisions en planification et ordonnancement dans une chaîne logistique
Gomez Urrutia,Edwin David +1 more
TL;DR: In this article, the authors propose an approche integree for resoudre problems of planification andordonnancement in multi-niveaux and multi-scale systems, respectively.
Dissertation
Fix-and-Optimize Heuristic and MP-based Approaches for Capacitated Lot Sizing Problem with Setup Carryover, Setup Splitting and Backlogging
TL;DR: A fix-and-optimize heuristic with two-stage product decomposition and period decomposition strategies is proposed to solve a single-level, multi-item capacitated lot sizing problem with setup carryover, setup splitting and backlogging.
References
More filters
Journal ArticleDOI
A review of scheduling research involving setup considerations
TL;DR: A comprehensive review of the literature on scheduling problems involving setup times (costs) classifies scheduling problems into batch and non-batch, sequence-independent and sequence-dependent setup, and categorizes the literature according to the shop environments of single machine, parallel machines, flowshops, and job shops.
Journal ArticleDOI
Capacitated lot sizing with setup times
TL;DR: In this paper, a Lagrangian relaxation of the capacity constraints of CLSP allows it to be decomposed into a set of uncapacitated single product lot sizing problems, which are solved by dynamic programming.
Journal ArticleDOI
Modeling Industrial Lot Sizing Problems: A Review
Raf Jans,Zeger Degraeve +1 more
TL;DR: In this article, the authors give an overview of recent developments in the field of modeling deterministic single-level dynamic lot sizing problems, focusing on the modeling of various industrial extensions and not on the solution approaches.
Journal ArticleDOI
Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
TL;DR: A review of four decades of research on dynamic lot-sizing with capacity constraints shows that many practically important problems are still far from being solved in the sense that they could routinely be solved close to optimality in industrial practice.
Journal ArticleDOI
Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic
TL;DR: In this paper, a fix-and-optimize algorithm for the dynamic multi-level capacitated lot sizing problem with setup carry-overs (MLCLSP-L) is presented.