Add to ORKGThis paper considers a dynamic lot-sizing problem with backlogging under a minimum replenishment policy. For general concave production costs, we propose an O(T5) dynamic programming algorithm. If speculative motive is not allowed, in this case, a more efficient O(T4) algorithm is developed
This paper proposes two new mixed integer programming models for capacitated multi-level lot-sizing ...
textabstractWe address the dynamic lot sizing problem for systems with product returns. The demand a...
In this research, algorithms are developed to address the problem of dynamic lot sizing and scheduli...
This paper considers a dynamic lot-sizing problem with storage capacity limitation in which backlogg...
International audienceThis paper addresses a dynamic lot sizing problem with bounded inventory and s...
This paper addresses a single item capacitated dynamic lot sizing problem. We consider backlogging m...
a b s t r a c t This paper addresses a real-life production planning problem arising in a manufactur...
We develop an algorithm that solves the constant capacities economic lot-sizing problem with concave...
In this paper, a case study is carried out concerning the lot-sizing problem involving a single item...
This article considers optimization problems in a capacitated lot sizing model with limited backlogg...
International audienceThis paper addresses a real-life production planning problem arising in a manu...
We develop an algorithm that solves the constant capacities economic lot-sizing problem with concave...
This paper addresses a single item dynamic lot sizing problem where the inventory capacity is limite...
This paper proposes two new mixed integer programming models for capacitated multi-level lot-sizing ...
textabstractOne of the basic assumptions of the classical dynamic lot-sizing model is that the aggre...
This paper proposes two new mixed integer programming models for capacitated multi-level lot-sizing ...
textabstractWe address the dynamic lot sizing problem for systems with product returns. The demand a...
In this research, algorithms are developed to address the problem of dynamic lot sizing and scheduli...
This paper considers a dynamic lot-sizing problem with storage capacity limitation in which backlogg...
International audienceThis paper addresses a dynamic lot sizing problem with bounded inventory and s...
This paper addresses a single item capacitated dynamic lot sizing problem. We consider backlogging m...
a b s t r a c t This paper addresses a real-life production planning problem arising in a manufactur...
We develop an algorithm that solves the constant capacities economic lot-sizing problem with concave...
In this paper, a case study is carried out concerning the lot-sizing problem involving a single item...
This article considers optimization problems in a capacitated lot sizing model with limited backlogg...
International audienceThis paper addresses a real-life production planning problem arising in a manu...
We develop an algorithm that solves the constant capacities economic lot-sizing problem with concave...
This paper addresses a single item dynamic lot sizing problem where the inventory capacity is limite...
This paper proposes two new mixed integer programming models for capacitated multi-level lot-sizing ...
textabstractOne of the basic assumptions of the classical dynamic lot-sizing model is that the aggre...
This paper proposes two new mixed integer programming models for capacitated multi-level lot-sizing ...
textabstractWe address the dynamic lot sizing problem for systems with product returns. The demand a...
In this research, algorithms are developed to address the problem of dynamic lot sizing and scheduli...