Rachid Benmansour

Rachid Benmansour

Auto-generated profile, based on publicly available information

Rachid Benmansour

SI2M Laboratory, INSEA, Rabat, Morocco

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

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

Representative Publications

View All Publications
9 August 2021 in Annals of Operations Research
Verified
Journal Article
Closed access
PDF file
MBMohammed Bazirha
Mohammed Bazirha
AKAbdeslam Kadrani
Abdeslam Kadrani
RBRachid Benmansour
Rachid Benmansour

3 February 2020 in Journal of Global Optimization
Verified
Journal Article
Closed access
PDF file
IKIssam Krimi
Issam Krimi
RTRaca Todosijevic
Raca Todosijevic
RBRachid Benmansour
Rachid Benmansour
MRMustapha Ratli
Mustapha Ratli
Abdessamad Ait El CadiAbdessamad Ait El Cadi
Abdessamad Ait El Cadi
AAAfaf Aloullal
Afaf Aloullal

1 July 2014 in Computers & Operations Research
Verified
Journal Article
Closed access
RBRachid Benmansour
Rachid Benmansour
HAHamid Allaoui
Hamid Allaoui
AAAbdelhakim Artiba
Abdelhakim Artiba
SHSaïd Hanafi
Saïd Hanafi

1 July 2016 in European Journal of Operational Research
Verified
Journal Article
Closed access
RTRaca Todosijevic
Raca Todosijevic
RBRachid Benmansour
Rachid Benmansour
SHSaïd Hanafi
Saïd Hanafi
NMNenad Mladenovic
Nenad Mladenovic
AAAbdelhakim Artiba
Abdelhakim Artiba

1 April 2017 in Electronic Notes in Discrete Mathematics
Verified
Journal Article
Closed access
RMRita Macedo
Rita Macedo
RBRachid Benmansour
Rachid Benmansour
AAAbdelhakim Artiba
Abdelhakim Artiba
NMNenad Mladenovic
Nenad Mladenovic
DUDragan Urošević
Dragan Urošević

25 August 2020 in International Journal of Production Research
Verified
Journal Article
Closed access
AEAbdelhak Elidrissi
Abdelhak Elidrissi
RBRachid Benmansour
Rachid Benmansour
MBMohammed Benbrahim
Mohammed Benbrahim
DDDavid Duvivier
David Duvivier
This paper addresses the problem of scheduling independent jobs on identical parallel machines with a single server to minimise the makespan. We propose mixed integer programming (MIP) formulations to solve this problem. Each formulation reflects a specific concept on how the decision variables are defined. Moreover, we present inequalities that can be used to improve those formulations. A computational study is performed on benchmark instances from the literature to compare the proposed MIP formulations with other known formulations from the literature. It turns out that our proposed time-indexed variables formulation outperforms by far the other formulations. In addition, we propose a very efficient MIP formulation to solve a particular case of the problem with a regular job set. This formulation is able to solve all regular instances for the case of 500 jobs and 5 machines in less than 5.27 min, where all other formulations are not able to produce a feasible solution within 1 h.