This paper proposes a mixed integer programming formulation for modeling the capacitated multi-level lot sizing problem with both backlogging and setup carryover. Based on the model formulation, a progressive time-oriented decomposition heuristic framework is then proposed, where improvement and construction heuristics are effectively combined, therefore efficiently avoiding the weaknesses associated with the one-time decisions made by other classical time-oriented decomposition algorithms. Computational results show that the proposed optimization framework provides competitive solutions within a reasonable time
This paper presents a novel mathematical programming approach to the single-machine capacitated lot-...
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 two new mixed integer programming models for capacitated multi-level lot-sizing ...
Various mixed-integer programming models have been proposed for solving the capacitated multi-level ...
This paper proposes two new mixed integer programming models for capacitated multi-level lot-sizing ...
We address the multi-item, capacitated lot-sizing problem (CLSP) encountered in environments where d...
The classical capacitated lot sizing problem is shown to be NP -hard for even a single item problem....
The classical capacitated lot sizing problem is shown to be NP -hard for even a single item problem....
AbstractWe provide formulation techniques for obtaining sharp (i.e., convex hull) mixed integer prog...
We present an introduction to the use of mixed integer programming to solve production planning and ...
Setup operations are significant in some production environments. It is mandatory that their product...
International audienceIn the last few years, there has been a growing interest in the disassembly sc...
A rich lot-sizing problem is studied in this manuscript which comes from a real-world application. O...
Several mixed integer programming formulations have been proposed for modeling capacitated multi-lev...
This paper presents a novel mathematical programming approach to the single-machine capacitated lot-...
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 two new mixed integer programming models for capacitated multi-level lot-sizing ...
Various mixed-integer programming models have been proposed for solving the capacitated multi-level ...
This paper proposes two new mixed integer programming models for capacitated multi-level lot-sizing ...
We address the multi-item, capacitated lot-sizing problem (CLSP) encountered in environments where d...
The classical capacitated lot sizing problem is shown to be NP -hard for even a single item problem....
The classical capacitated lot sizing problem is shown to be NP -hard for even a single item problem....
AbstractWe provide formulation techniques for obtaining sharp (i.e., convex hull) mixed integer prog...
We present an introduction to the use of mixed integer programming to solve production planning and ...
Setup operations are significant in some production environments. It is mandatory that their product...
International audienceIn the last few years, there has been a growing interest in the disassembly sc...
A rich lot-sizing problem is studied in this manuscript which comes from a real-world application. O...
Several mixed integer programming formulations have been proposed for modeling capacitated multi-lev...
This paper presents a novel mathematical programming approach to the single-machine capacitated lot-...
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 ...