Safia Kedad-Sidhoum
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Safia Kedad-Sidhoum has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Nabil Absi
Mines Saint-Etienne, Univ Clermont Auvergne, INP Clermont Auvergne, CNRS, UMR 6158 LIMOS, Saint-Etienne, France
2 shared publications - Fanny Pascual
LIP6, Sorbonne Université
1 shared publication - Francis Sourd
Université Pierre et Marie Curie
1 shared publication - Nadjib Brahimi
Rennes School of Business
1 shared publication - Siao-Leu Phouratsamay1 shared publication
- Stéphane Dauzère-Pérès
Mines Saint-Etienne, Univ Clermont Auvergne, CNRS, UMR 6158 LIMOS, Gardanne, France
1 shared publication
Latest Publications
- Open Access
Two-level lot-sizing with inventory bounds
We study a two-level uncapacitated lot-sizing problem with inventory bounds that occurs in a supply chain composed of a supplier and a retailer. The first level with the demands is the retailer level and the second one is the supplier level. The aim is to minimize the cost of the supply chain so as to satisfy the demands when the quantity of item that can be held in inventory at each period is limited. The inventory bounds can be imposed at the retailer level, at the supplier level or at both levels. We propose a polynomial dynamic programming algorithm to solve this problem when the inventory bounds are set on the retailer level. When the inventory bounds are set on the supplier level, we show that the problem is NP-hard. We give a pseudo-polynomial algorithm which solves this problem when there are inventory bounds on both levels. In the case where demand lot-splitting is not allowed, i.e. each demand has to be satisfied by a single order, we prove that the uncapacitated lot-sizing problem with inventory bounds is strongly NP-hard. This implies that the two-level lot-sizing problems with inventory bounds are also strongly NP-hard when demand lot-splitting is considered.
Open AccessTwo-level lot-sizing with inventory bounds
We study a two-level uncapacitated lot-sizing problem with inventory bounds that occurs in a supply chain composed of a supplier and a retailer. The first level with the demands is the retailer level and the second one is the supplier level. The aim is to minimize the cost of the supply chain so as to satisfy the demands when the quantity of item that can be held in inventory at each period is limited. The inventory bounds can be imposed at the retailer level, at the supplier level or at both levels. We propose a polynomial dynamic programming algorithm to solve this problem when the inventory bounds are set on the retailer level. When the inventory bounds are set on the supplier level, we show that the problem is NP-hard. We give a pseudo-polynomial algorithm which solves this problem when there are inventory bounds on both levels. In the case where demand lot-splitting is not allowed, i.e. each demand has to be satisfied by a single order, we prove that the uncapacitated lot-sizing problem with inventory bounds is strongly NP-hard. This implies that the two-level lot-sizing problems with inventory bounds are also strongly NP-hard when demand lot-splitting is considered.
- 10 June 2015
- Published by Springer Nature in OR Spectrum
- Vol. 37 (4) , 983-1006
Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory
- 10 June 2015
- Published by Springer Nature in OR Spectrum
- Vol. 37 (4) , 983-1006
Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory
- 29 December 2012
- Published by Springer Nature in Annals of Operations Research
- Vol. 213 (1) , 187-202
Batch sizing and just-in-time scheduling with common due date
- 29 December 2012
- Published by Springer Nature in Annals of Operations Research
- Vol. 213 (1) , 187-202
Batch sizing and just-in-time scheduling with common due date
- 17 November 2007
- Published by Springer Nature in Journal of Scheduling
- Vol. 11 (1) , 49-58
A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
- 17 November 2007
- Published by Springer Nature in Journal of Scheduling
- Vol. 11 (1) , 49-58
A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
- 1 April 2007
- Published by EDP Sciences in RAIRO - Operations Research
- Vol. 41 (2) , 171-192
MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs
We address a multi-item capacitated lot-sizing problem with setup times that arises in real-world production planning contexts. Demand cannot be backlogged, but can be totally or partially lost. Safety stock is an objective to reach rather than an industrial constraint to respect. The problem is NP-hard. We propose mixed integer programming heuristics based on a planning horizon decomposition strategy to find a feasible solution. The planning horizon is partitioned into several sub-horizons over which a freezing or a relaxation strategy is applied. Some experimental results showing the effectiveness of the approach on real-world instances are presented. A sensitivity analysis on the parameters of the heuristics is reported.
- 1 April 2007
- Published by EDP Sciences in RAIRO - Operations Research
- Vol. 41 (2) , 171-192
MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs
We address a multi-item capacitated lot-sizing problem with setup times that arises in real-world production planning contexts. Demand cannot be backlogged, but can be totally or partially lost. Safety stock is an objective to reach rather than an industrial constraint to respect. The problem is NP-hard. We propose mixed integer programming heuristics based on a planning horizon decomposition strategy to find a feasible solution. The planning horizon is partitioned into several sub-horizons over which a freezing or a relaxation strategy is applied. Some experimental results showing the effectiveness of the approach on real-world instances are presented. A sensitivity analysis on the parameters of the heuristics is reported.