Journal ArticleDOI
A note on modelling the capacitated lot-sizing problem with set-up carryover and set-up splitting
Reads0
Chats0
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
Journal ArticleDOI
A review of discrete-time optimization models for tactical production planning
TL;DR: In this paper, the authors present a review of optimization models for tactical production planning and identify streams and future research directions in this field based on the different classification criteria proposed by the authors.
Journal ArticleDOI
Parallel machine, capacitated lot-sizing and scheduling for the pipe-insulation industry
Jesica de Armas,Manuel Laguna +1 more
TL;DR: A solution procedure for a production problem that involves the optimal lot-sizing and scheduling of multiple products on parallel machines over a long planning horizon is developed, in the context of the manufacturing of pipe insulation.
Posted Content
Solving a Multi-Level Capacitated Lot Sizing Problem with Multi-Period Setup Carry-Over via a Fix-and-Optimize Heuristic
TL;DR: A new algorithm for the dynamic Multi-Level Capacitated Lot Sizing Problem with Setup Carry-Overs which is applicable to general bill-of-material structures and which includes minimum lead times of one period and multi-period setup carry-overs is presented.
Journal ArticleDOI
An analysis of formulations for the capacitated lot sizing problem with setup crossover
TL;DR: A computational study is presented to determine which is the best formulation to model a setup crossover and ideas indicating that in one of the formulations from the literature it is not necessary to impose binary conditions on the crossover variables are explored.
Journal ArticleDOI
Capacitated lot-sizing problem with production carry-over and set-up splitting: mathematical models
TL;DR: In this article, the authors proposed a mathematical model for capacitated lot sizing with production carryover and set-up splitting, which can handle two scenarios, namely (1) situation/scenario where the setup costs and holding costs are product dependent and time independent, and with no backorders or lost sales, and (2) situation where the setting costs and hold costs are not product dependent but time dependent.
References
More filters
Journal ArticleDOI
A framework for modelling setup carryover in the capacitated lot sizing problem
TL;DR: In this paper, the authors consider a class of production planning problems in which multiple products can be produced within a time period and significant setup times are incurred when changing from one product to another.
Journal ArticleDOI
Multiperiod production planning carrying over set-up time
TL;DR: The shortening of production planning periods to days, shifts or even less has increased production capacity time and continue troubling production planning, especially on bottlenecks as discussed by the authors, and this shortening has increased the cost of set-ups.
Journal ArticleDOI
A modified framework for modelling set-up carryover in the capacitated lotsizing problem
TL;DR: In this article, a modified framework to model set-up carryovers in the capacitated lotsizing problem is presented, which allows product dependent setup times and costs to be incorporated.
Journal ArticleDOI
A network flow model for the capacitated lot-sizing problem
TL;DR: In this article, a branch-and-bound method is proposed to solve the problem of lot-sizing in a single machine over a finite planning horizon divided into time periods, where the objective is to determine a minimum cost production plan that meets the forecast demand for the items.