Follow
Brahim BENMEDJDOUB
Title
Cited by
Cited by
Year
Branch-and-bound and PSO algorithms for no-wait job shop scheduling
A AitZai, B Benmedjdoub, M Boudhar
Journal of Intelligent Manufacturing 27, 679-688, 2016
522016
A branch and bound and parallel genetic algorithm for the job shop scheduling problem with blocking
A AitZai, B Benmedjdoub, M Boudhar
International Journal of Operational Research 14 (3), 343-365, 2012
322012
2-distance colorings of integer distance graphs
B Benmedjdoub, I Bouchemakh, É Sopena
Discussiones Mathematicae Graph Theory 39 (2), 589-603, 2019
102019
Incidence choosability of graphs
B Benmedjdoub, I Bouchemakh, É Sopena
Discrete Applied Mathematics 265, 40-55, 2019
52019
Incidence choosability of graphs
B Benmedjdoub, I Bouchemakh, E Sopena, Â Sopena
arXiv preprint arXiv:1705.01744, 2017
32017
On the list incidence chromatic number of graphs
B Benmedjdoub, E Sopena, I Bouchemakh
Bordeaux Graphs Workshop, BGW 16, 2016
22016
Strong incidence colouring of graphs
B Benmedjdoub, É Sopena
Discussiones Mathematicae Graph Theory, 2021
12021
Colorations d’incidences
B Benmedjdoub
12018
Job shop avec contraintes de blocage et de sans attente
B Benmedjdoub
Alger, 2010
2010
The system can't perform the operation now. Try again later.
Articles 1–9