A rich lot-sizing problem is studied in this manuscript which comes from a real-world application. Our new lot-sizing problem combines several features, i.e., parallel machines, production time windows, backlogging, lost sale and setup carryover. Three mixed integer programming formulations are proposed. We theoretically and computationally compare these different formulations, testing them on real-world and randomly generated instances. Our study is the first step for efficiently tackling and solving this challenging real-world lot-sizing problem.nonouirechercheInternationa
International audienceWe study a production planning problem known as the Discrete Lot-sizing and Sc...
In this paper, a case study is carried out concerning the lot-sizing problem involving a single item...
International audienceThis paper studies an industrial lot-sizing and scheduling problem coming from...
Based on research on the polyhedral structure of lot-sizing models over the last twenty years, we cl...
Scheduling multiple products with limited resources and varying demands remain a critical challenge ...
The classical capacitated lot sizing problem is shown to be NP -hard for even a single item problem....
This paper presents a novel mathematical programming approach to the single-machine capacitated lot-...
We address the multi-item, capacitated lot-sizing problem (CLSP) encountered in environments where d...
We address a multi-item capacitated lot-sizing problem with setup times that arises in real-world pr...
In spite of the remarkable improvements in the quality of general purpose mixed integer programming ...
In spite of the remarkable improvements in the quality of general purpose mixed integer programming ...
This paper proposes a mixed integer programming formulation for modeling the capacitated multi-level...
In this study, a mathematical model for the integration of lot sizing and flow shop scheduling with ...
Title: Lot-sizing problem Author: Ondřej Kafka Department: Department of probability and mathematica...
Several mixed integer programming formulations have been proposed for modeling capacitated multi-lev...
International audienceWe study a production planning problem known as the Discrete Lot-sizing and Sc...
In this paper, a case study is carried out concerning the lot-sizing problem involving a single item...
International audienceThis paper studies an industrial lot-sizing and scheduling problem coming from...
Based on research on the polyhedral structure of lot-sizing models over the last twenty years, we cl...
Scheduling multiple products with limited resources and varying demands remain a critical challenge ...
The classical capacitated lot sizing problem is shown to be NP -hard for even a single item problem....
This paper presents a novel mathematical programming approach to the single-machine capacitated lot-...
We address the multi-item, capacitated lot-sizing problem (CLSP) encountered in environments where d...
We address a multi-item capacitated lot-sizing problem with setup times that arises in real-world pr...
In spite of the remarkable improvements in the quality of general purpose mixed integer programming ...
In spite of the remarkable improvements in the quality of general purpose mixed integer programming ...
This paper proposes a mixed integer programming formulation for modeling the capacitated multi-level...
In this study, a mathematical model for the integration of lot sizing and flow shop scheduling with ...
Title: Lot-sizing problem Author: Ondřej Kafka Department: Department of probability and mathematica...
Several mixed integer programming formulations have been proposed for modeling capacitated multi-lev...
International audienceWe study a production planning problem known as the Discrete Lot-sizing and Sc...
In this paper, a case study is carried out concerning the lot-sizing problem involving a single item...
International audienceThis paper studies an industrial lot-sizing and scheduling problem coming from...