Nadjib Brahimi

Dr. Nadjib Brahimi


Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2006 in European Journal of Operational Research
Verified
Journal Article
Closed access
NBNadjib Brahimi
Nadjib Brahimi
SDStéphane Dauzere-Peres
Stéphane Dauzere-Peres
NNNajib M. Najid
Najib M. Najid
ANAtle Nordli
Atle Nordli

1 December 2017 in European Journal of Operational Research
Verified
Journal Article
Closed access
NBNadjib Brahimi
Nadjib Brahimi
Nabil AbsiNabil Absi
Nabil Absi
SDStéphane Dauzère-Pérès
Stéphane Dauzère-Pérès
ANAtle Nordli
Atle Nordli

21 May 2015 in International Journal of Production Research
Verified
Journal Article
Closed access
NBNadjib Brahimi
Nadjib Brahimi
TATarik Aouam
Tarik Aouam

17 March 2022 in European Journal of Operational Research
Verified
Journal Article
Closed access
STSimon Thevenin
Simon Thevenin
OBOussama Ben-Ammar
Oussama Ben-Ammar
NBNadjib Brahimi
Nadjib Brahimi

1 August 2013 in European Journal of Operational Research
Verified
Journal Article
Closed access
Tarik AouamTarik Aouam
Tarik Aouam
NBNadjib Brahimi
Nadjib Brahimi

1 October 2006 in Operations Research
Verified
Journal Article
Closed access
NBNadjib Brahimi
Nadjib Brahimi
SDStéphane Dauzère-Pérès
Stéphane Dauzère-Pérès
NNNajib M. Najid
Najib M. Najid
This research concerns a new family of capacitated multi-item lot-sizing problems, namely, lot-sizing problems with time windows. Two classes of the problem are analyzed and solved using different Lagrangian heuristics. Capacity constraints and a subset of time window constraints are relaxed resulting in particular single-item time window problems that are solved in polynomial time. Other relaxations leading to the classical Wagner-Whitin problem are also tested. Several smoothing heuristics are implemented and tested, and their results are compared. The gaps between lower and upper bounds for most problems are very small (less than 1%). Moreover, the proposed algorithms are robust and do not seem to be too affected when different parameters of the problem are varied.