International audienceLot-sizing and pricing are two important manufacturing decisions that impact together the profit of a company. Existing works address the joint lot-sizing and pricing problem without backlogging, although it is a usual strategy that permits to satisfy customer demand with delay. In this work, we study a new multi-product joint lot-sizing and pricing problem with backlogging and limited production capacity. The objective is to maximize the total company profit over a finite planning horizon. For the problem, a mixed integer nonlinear programming (MINLP) formulation is given. Then, several optimality properties are provided and a tighter MINLP model is established based on these properties. According to the NP-hard natur...
Joint optimization of maintenance and lot-sizing-related operations offers significant benefits for ...
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....
International audienceThis paper addresses a capacitated lot-sizing problem with pricing decisions. ...
This paper addresses the problem of scheduling economic lots in a multi-product single-machine envir...
AbstractThis paper presents an Integer Linear Programming model for a multi-product lot-sizing probl...
This paper proposes two new mixed integer programming models for capacitated multi-level lot-sizing ...
International audienceJoint optimization of maintenance and lot-sizing-related operations offers sig...
a b s t r a c t This paper addresses a real-life production planning problem arising in a manufactur...
This paper proposes two new mixed integer programming models for capacitated multi-level lot-sizing ...
International audienceThis paper addresses a real-life production planning problem arising in a manu...
International audienceThis paper addresses a real-life production planning problem arising in a manu...
AbstractLot-sizing is a very important problem in production and inventory planning under variable d...
This paper proposes a mixed integer programming formulation for modeling the capacitated multi-level...
AbstractLot-sizing is a very important problem in production and inventory planning under variable d...
Joint optimization of maintenance and lot-sizing-related operations offers significant benefits for ...
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....
International audienceThis paper addresses a capacitated lot-sizing problem with pricing decisions. ...
This paper addresses the problem of scheduling economic lots in a multi-product single-machine envir...
AbstractThis paper presents an Integer Linear Programming model for a multi-product lot-sizing probl...
This paper proposes two new mixed integer programming models for capacitated multi-level lot-sizing ...
International audienceJoint optimization of maintenance and lot-sizing-related operations offers sig...
a b s t r a c t This paper addresses a real-life production planning problem arising in a manufactur...
This paper proposes two new mixed integer programming models for capacitated multi-level lot-sizing ...
International audienceThis paper addresses a real-life production planning problem arising in a manu...
International audienceThis paper addresses a real-life production planning problem arising in a manu...
AbstractLot-sizing is a very important problem in production and inventory planning under variable d...
This paper proposes a mixed integer programming formulation for modeling the capacitated multi-level...
AbstractLot-sizing is a very important problem in production and inventory planning under variable d...
Joint optimization of maintenance and lot-sizing-related operations offers significant benefits for ...
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....