{"id":58,"date":"2023-06-20T14:04:11","date_gmt":"2023-06-20T14:04:11","guid":{"rendered":"http:\/\/193.194.89.179\/wp_lrecits\/?page_id=58"},"modified":"2025-01-07T10:02:12","modified_gmt":"2025-01-07T10:02:12","slug":"recherche-operationnelle-pour-le-transport-et-lordonnancement-en-productique-ro-top","status":"publish","type":"page","link":"https:\/\/lrecits.usthb.dz\/index.php\/recherche-operationnelle-pour-le-transport-et-lordonnancement-en-productique-ro-top\/","title":{"rendered":"Recherche Op\u00e9rationnelle pour le Transport et l&#8217;ordonnancement en Productique (RO-TOP)"},"content":{"rendered":"\n<figure class=\"wp-block-table\"><table class=\"has-background\" style=\"background:radial-gradient(rgb(255,245,203) 12%,rgb(182,227,212) 50%,rgb(51,167,181) 100%)\"><tbody><tr><td>Equipe<\/td><td>Recherche Op\u00e9rationnelle pour le Transport et l&#8217;ordonnancement en Productique<img loading=\"lazy\" decoding=\"async\" width=\"141\" height=\"114\" class=\"wp-image-149\" style=\"width: 141px;\" src=\"https:\/\/lrecits.usthb.dz\/wp-content\/uploads\/2024\/03\/Logo-ROTOP-eq2.png\" alt=\"\"><\/td><\/tr><tr><td>Responsable<\/td><td>Pr. BOUDHAR Mourad<\/td><\/tr><tr><td>Mail<\/td><td>mboudhar@usthb.dz<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<h2 class=\"wp-block-heading\">Pr\u00e9sentation<\/h2>\n\n\n\n<p>RO-TOP est une \u00e9quipe de recherche qui s&#8217;int\u00e9resse \u00e0 l&#8217;optimisation des syst\u00e8mes de production qui regroupe l&#8217;ensemble des activit\u00e9s qui ont pour objectif l&#8217;aide \u00e0 la prise de d\u00e9cisions, et ce, pour optimiser les performances des syst\u00e8mes en phase de conception et d&#8217;exploitation. Les outils de la recherche op\u00e9rationnelle, des math\u00e9matiques appliqu\u00e9es et de l&#8217;informatique pour l&#8217;ordonnancement d&#8217;activit\u00e9s seront les principaux th\u00e8mes \u00e0 aborder par les chercheurs de l&#8217;\u00e9quipe. Les probl\u00e8mes d&#8217;ordonnancement, quelque soit le secteur d&#8217;activit\u00e9 dans lequel nous nous pla\u00e7ons, sont connus pour \u00eatre difficiles \u00e0 r\u00e9soudre. Ils constituent donc une source de gains potentiels pour les entreprises, et un v\u00e9ritable d\u00e9fi pour les chercheurs du domaine. Nous travaillons depuis plusieurs ann\u00e9es sur les probl\u00e8mes classiques de l&#8217;ordonnancement, mais nous d\u00e9veloppons plus sp\u00e9cifiquement des travaux sur l&#8217;ordonnancement avec prise en compte de contraintes additionnelles dont le transport.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\">Membres<\/h2>\n\n\n\n<figure class=\"wp-block-table is-style-stripes\"><table class=\"has-pale-ocean-gradient-background has-background\"><tbody><tr><td>BOUDHAR Mourad<\/td><td>Doctorat d&#8217;Etat, Professeur<\/td><\/tr><tr><td>AITZAI Abdelhakim<\/td><td>Doctorat, Professeur<\/td><\/tr><tr><td>BENDRAOUCHE Mohamed<\/td><td>Doctorat, Professeur<\/td><\/tr><tr><td>AMROUCHE Karim<\/td><td>Doctorat, MCA<\/td><\/tr><tr><td>HANED BOULKHIOUT Amina<\/td><td>Doctorat, MCB<\/td><\/tr><tr><td>LABBI Wafaa<\/td><td>Doctorat, MCB<\/td><\/tr><tr><td>MEZIANI Nadjat<\/td><td>Doctorat, MCB<\/td><\/tr><tr><td>TIGANE Meriem<\/td><td>Doctorat, MCB<\/td><\/tr><tr><td>KHEDIMI HAOUI Amina<\/td><td>Magister, MAA, Doctorante<\/td><\/tr><tr><td>BAZIZ Mohamed-El-Ghazali<\/td><td>Master, Doctorant<\/td><\/tr><tr><td>KHEBOUCHE Ali<\/td><td>Master, Doctorant<\/td><\/tr><tr><td>LAKEHAL Soumaya<\/td><td>Doctorat, MAB<\/td><\/tr><tr><td>RECIOUI Asma<\/td><td>Master, Doctorante<\/td><\/tr><tr><td>RIHANE Karima<\/td><td>Master, Doctorante<\/td><\/tr><tr><td>SAMI Nazim<\/td><td>Master, Doctorant<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<h2 class=\"wp-block-heading\">Ancien-ne-s membres<\/h2>\n\n\n\n<figure class=\"wp-block-table is-style-stripes\"><table class=\"has-pale-ocean-gradient-background has-background\"><tbody><tr><td>AZERINE Abdennour<\/td><td>Doctorat, AR<\/td><\/tr><tr><td>BABOU Nadia<\/td><td>Doctorat, AR<\/td><\/tr><tr><td>BADAOUI Ryma Zineb<\/td><td>Doctorat, AR<\/td><\/tr><tr><td>DABAH Adel<\/td><td>Doctorat, AR<\/td><\/tr><tr><td>TELLACHE Nour El Houda<\/td><td>Doctorat, AR<\/td><\/tr><tr><td>MOHABEDDINE Amine<\/td><td>Doctorat, AR<\/td><\/tr><tr><td>MALLEK Amin<\/td><td>Doctorat, AR<\/td><\/tr><tr><td>NOURI Sarah<\/td><td>Doctorat, AR<\/td><\/tr><tr><td>OUIDDIR Djedjiga<\/td><td>Doctorat, AR<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<hr class=\"wp-block-separator has-alpha-channel-opacity\"\/>\n\n\n\n<h2 class=\"wp-block-heading\">Objectif et Comp\u00e9tences<\/h2>\n\n\n\n<p>L&#8217;\u00e9quipe RO-TOP \u00e9tudie et propose des mod\u00e8les et des algorithmes de r\u00e9solution des probl\u00e8mes conjoints d&#8217;ordonnancement et de transport dans les syst\u00e8mes de production. L&#8217;architecture du syst\u00e8me de production que nous proposons d&#8217;\u00e9tudier est la plus proche de la r\u00e9alit\u00e9 industrielle, nous prendrons en compte le plus de contraintes sp\u00e9cifiques possible, \u00e0 savoir, la capacit\u00e9 limit\u00e9e des moyens de transport, l&#8217;acc\u00e8s concurrent aux espaces de stockage, la prise en compte du temps de transfert des produits entre les machines, la recirculation des t\u00e2ches dans l&#8217;atelier. L&#8217;id\u00e9e est de proposer des outils d&#8217;aide \u00e0 la d\u00e9cision pour permettre au d\u00e9cideur de choisir un compromis pour la conduite et le contr\u00f4le de la production et du transport. Une phase de simulation des diff\u00e9rents sc\u00e9narios de production est envisag\u00e9e ce qui permettra la validation des mod\u00e8les et m\u00e9thodes propos\u00e9s. Parall\u00e8lement, nous prendrons en compte l&#8217;aspect multicrit\u00e8re et l&#8217;incertitude des donn\u00e9es, ce qui contribuera \u00e0 la stabilit\u00e9 et la robustesse des m\u00e9thodes propos\u00e9es.<\/p>\n\n\n\n<hr class=\"wp-block-separator has-alpha-channel-opacity\"\/>\n\n\n\n<h2 class=\"wp-block-heading\">Projets de Recherche<\/h2>\n\n\n\n<p>L&#8217;\u00e9quipe participe aux projets scientifiques suivants.<\/p>\n\n\n\n<p>CNEPRU : (en cours)<\/p>\n\n\n\n<figure class=\"wp-block-table is-style-stripes\"><table><tbody><tr><th scope=\"row\">N\u00b0<\/th><td>C00L03UN160420150007<\/td><\/tr><tr><th scope=\"row\">Intitul\u00e9<\/th><td>RO-TOP Recherche Op\u00e9rationnelle pour le Transport et l&#8217;ordonnancement en Productique<\/td><\/tr><tr><th scope=\"row\">Responsable<\/th><td>Pr. BOUDHAR Mourad<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<p>CNEPRU : (en cours)<\/p>\n\n\n\n<figure class=\"wp-block-table is-style-stripes\"><table><tbody><tr><th scope=\"row\">N\u00b0<\/th><td>C00L03UN160420150020<\/td><\/tr><tr><th scope=\"row\">Intitul\u00e9<\/th><td>TROIASP Techniques de Recherche Op\u00e9rationnelle et d&#8217;Informatique Appliqu\u00e9es aux Syst\u00e8mes de Production<\/td><\/tr><tr><th scope=\"row\">Responsable<\/th><td>Dr. AITZAI Abdelhakim<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<p>CNEPRU : (achev\u00e9)<\/p>\n\n\n\n<figure class=\"wp-block-table is-style-stripes\"><table><tbody><tr><th scope=\"row\">N\u00b0<\/th><td>B00220120037<\/td><\/tr><tr><th scope=\"row\">Intitul\u00e9<\/th><td>RO-TOP Recherche Op\u00e9rationnelle pour le Transport et l&#8217;ordonnancement en Productique<\/td><\/tr><tr><th scope=\"row\">Responsable<\/th><td>Pr. BOUDHAR Mourad<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<p>PNR : (achev\u00e9)<\/p>\n\n\n\n<figure class=\"wp-block-table is-style-stripes\"><table><tbody><tr><th scope=\"row\">Agence<\/th><td>ATRST (ex ANDRU)<\/td><\/tr><tr><th scope=\"row\">N\u00b0<\/th><td>8\/u160\/737<\/td><\/tr><tr><th scope=\"row\">Intitul\u00e9<\/th><td>2MOT-Prod Mod\u00e8les et M\u00e9thodes pour l&#8217;Ordonnancement et le Transport en Productique,<\/td><\/tr><tr><th scope=\"row\">Responsable<\/th><td>Pr. BOUDHAR Mourad<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<hr class=\"wp-block-separator has-alpha-channel-opacity\"\/>\n\n\n\n<h2 class=\"wp-block-heading\">Production<\/h2>\n\n\n\n<p>La principale production scientifique de l&#8217;\u00e9quipe pour les ann\u00e9es 2013-2022 est :<\/p>\n\n\n\n<p><strong><u>Publications dans des revues :<\/u><\/strong><\/p>\n\n\n\n<blockquote class=\"wp-block-quote is-layout-flow wp-block-quote-is-layout-flow\">\n<ol style=\"background:linear-gradient(89deg,rgb(255,245,203) 0%,rgb(182,227,212) 50%,rgb(51,167,181) 100%)\" class=\"has-black-color has-text-color has-background has-link-color wp-block-list wp-elements-b7183b4624ab7914b0d153324ad671e7\">\n<li>Abdennour Azerine, Mourad Boudhar and Djamal Rebaine. A two-machine no-wait flow shop problem with two competing agents. Journal of Combintorial Optimization 43: 168\u2013199, 2022.<\/li>\n\n\n\n<li>Amina Khedimi, Tarek Menouer, Christophe C\u00e9rin and Mourad Boudhar. A cloud weather forecasting service and its relationship with anomaly detection. Service Oriented Computing and Applications 16: 191\u2013208, 2022.<\/li>\n\n\n\n<li>Amin Mallek and Mourad Boudhar. New complexity results on uniform machines scheduling with a conflict graph. International Transactions in Operational Research 0: 1\u201326, 2022.<\/li>\n\n\n\n<li>Nadia Babou, Djamal Rebaine and Mourad Boudhar. Two-machine open shop problem with a single server and set-up time considerations. Theoretical Computer Science 867: 13\u201329, 2021.<\/li>\n\n\n\n<li>Soumaya Lakehal, Abdelhakim Aitzai et Fatima Ghedjati. Parallel hybrid BBO-TS algorithm for QAP-formulation of FLP. International Journal of Advanced Manufacturing Technology 117: 3189\u20133209, 2021.<\/li>\n\n\n\n<li>Karim Amrouche, Mourad Boudhar and Nazim Sami. Two-machine chain-reentrant flow shop with the no-wait constraint. European Journal of Industrial Engineering 14(4): 573\u2013597, 2020.<\/li>\n\n\n\n<li>Ryma Zineb Badaoui, Mourad Boudhar and Mohammed Dahane. Preemptive scheduling with transportation delays between machines. Journal of Modelling in Management 15 (3): 829-847. 2020.<\/li>\n\n\n\n<li>Tarek Menouer, Amina Khedimi, Christophe C\u00e9rin, C. Jiang. Cloud Allocation and Consolidation Based on a Scalability Metric. In: Qiu, M. (eds) Algorithms and Architectures for Parallel Processing. Lecture Notes in Computer Science 12454, p. 381-395, 2020.<\/li>\n\n\n\n<li>Hac\u00e8ne Belbachir, Nassira Souddi and Meriem Tigane. Combinatorial properties of the r-Whitney numbers of Dowling lattices. Ars Combinatoria Vol. CXLVII: 51-62. 2019.<\/li>\n\n\n\n<li>Nour El Houda Tellache, Mourad Boudhar &amp; Farouk Yalaoui. Two-machine open shop problem with agreement graph. Theoretical Computer Science 796: 154-168, 2019.<\/li>\n\n\n\n<li>Abdelhakim AitZai, Adel Dabah and Mourad Boudhar. Tabu Search &amp; Gpu-Based Genetic Algorithm to Solve The Job Shop Scheduling Problem With Blocking. Journal of Advanced Research in Science and Technology (6)1: 949-961, 2019.<\/li>\n\n\n\n<li>Amin Mallek, Mohamed Bendraouche, Mourad Boudhar. Scheduling identical jobs on uniform machines with a conflict graph. Computers and Operations Research 111: 357\u2013366, 2019.<\/li>\n\n\n\n<li>Amine Mohabeddine and Mourad Boudhar. New results in two identical machines scheduling with agreement graphs. Theoretical Computer Science 779: 37\u201346, 2019.<\/li>\n\n\n\n<li>Meriem Tigane, Mohammed Dahane and Mourad Boudhar. Multiobjective approach for deteriorating jobs scheduling for a sustainable manufacturing system. The International Journal of Advanced Manufacturing Technology 101: 1939-1957, 2019.<\/li>\n\n\n\n<li>Nadjat Meziani, Ammar Oulamara and Mourad Boudhar. Scheduling the two-machine flowshop problem with coupled-operations. Annals of Operations Research 275: 511\u2013530, 2019.<\/li>\n\n\n\n<li>Adel Dabah, Ahcene Bendjoudi, Abdelhakim Ait Zai and Nadia Nouali Taboudjemat. Efficient parallel tabu search for the blocking job shop scheduling problem. Soft Computing 23 (24), 13283-13295, 2019<\/li>\n\n\n\n<li>Hacene BELBACHIR Nassira SOUDDI and&nbsp;<strong>Meriem TIGANE<\/strong>. Combinatorial properties of the r-Whitney numbers of Dowling lattices. Ars Combinatoria, to appear, accepted in 2018.<\/li>\n\n\n\n<li><strong>Meriem TIGANE<\/strong>, Mohammed DAHANE and&nbsp;<strong>Mourad BOUDHAR<\/strong>. Multiobjective approach for deteriorating jobs scheduling for a sustainable manufacturing system. The International Journal of Advanced Manufacturing Technology (accepted in 2018). https:\/\/doi.org\/10.1007\/s00170-018-3043-1.<\/li>\n\n\n\n<li><strong>Nadjat MEZIANI<\/strong>, Ammar OULAMARA and&nbsp;<strong>Mourad BOUDHAR<\/strong>. Scheduling the two-machine flowshop problem with coupled-operations. Annals of Operations Research (accepted in 2018). https:\/\/doi.org\/10.1007\/s10479-018-2967-z.<\/li>\n\n\n\n<li><strong>Adel DABAH<\/strong>, Ahc\u00e8ne BENDJOUDI,&nbsp;<strong>Abdelhakim AITZAI<\/strong>, Didier EL-BAZ, Nadia NOUALI-TABOUDJEMAT. Hybrid multi-core CPU and GPU-based B&amp;B approaches for the blocking job shop scheduling problem. Journal of Parallel and Distributed Computing 117: 73-86, 2018.<\/li>\n\n\n\n<li><strong>Nadjat MEZIANI<\/strong>,&nbsp;<strong>Mourad BOUDHAR<\/strong>&nbsp;and Ammar OULAMARA. PSO and SA for the two machines flowshop scheduling problem. European Journal of Industrial Engineering 12 (1): 43-66, 2018.<\/li>\n\n\n\n<li><strong>Nour El Houda TELLACHE<\/strong>&nbsp;and&nbsp;<strong>Mourad BOUDHAR<\/strong>. Flow shop scheduling problem with conflict graphs. Annals of Operations Research. 261: 339\u2013363, 2018.<\/li>\n\n\n\n<li><strong>Adel DABAH<\/strong>, Ahcene BENDJOUDI&nbsp; and &nbsp;&nbsp;<strong>Abdelhakim AITZAI<\/strong>. An efficient Tabu Search neighborhood based on reconstruction strategy to solve the blocking job shop scheduling problem. Journal of Industrial and Management Optimization 13(4) : 2015-2031, 2017.<\/li>\n\n\n\n<li><strong>Nour El Houda TELLACHE<\/strong>&nbsp;and&nbsp;<strong>Mourad Boudhar<\/strong>. Open shop scheduling problems with conflict graphs. Discrete Applied Mathematics, 227: 103-120, 2017.<\/li>\n\n\n\n<li><strong>Nour El Houda TELLACHE<\/strong>&nbsp;and&nbsp;<strong>Mourad Boudhar<\/strong>. Two-machine flow shop problem with unit-time operations and conflict graph. International Journal of Production Research, Vol. 55, No. 6, 1664\u20131679, 2017.<\/li>\n\n\n\n<li><strong>Karim AMROUCHE<\/strong>,&nbsp;<strong>Mourad Boudhar<\/strong>, Farouk YALAOUI and Mohamed BENDRAOUCHE. Chain-reentrant shop with an exact time lag: new results. International Journal of Production Research, 55 (1): 285-295, 2017.<\/li>\n\n\n\n<li><strong>Wafaa Labbi<\/strong>,&nbsp;<strong>Mourad Boudhar<\/strong>&nbsp;and Ammar Oulamara. Scheduling two identical parallel machines with preparation constraints. International Journal of Production Research Vol. 55, No. 6, 1531\u20131548, 2017.<\/li>\n\n\n\n<li><strong>Karim AMROUCHE<\/strong>&nbsp;and&nbsp;<strong>Mourad BOUDHAR<\/strong>. Two machines flow shop with reentrance and exact time lag. RAIRO &#8211; Operations Research 50 : 223-232, 2016.<\/li>\n\n\n\n<li><strong>Mohamed BENDRAOUCHE<\/strong>&nbsp;and&nbsp;<strong>Mourad BOUDHAR<\/strong>. Scheduling with agreements: new results. International Journal of Production Research 54 (12) : 3508-3522, 2016.<\/li>\n\n\n\n<li><strong>Abdelhakim AitZai<\/strong>, Brahim Benmedjdoub and&nbsp;<strong>Mourad Boudhar<\/strong>. Branch-and-Bound and PSO algorithms for no-wait Job shop scheduling. Journal of Intelligent Manufacturing 27 (3) : 679\u2013688, 2016<\/li>\n\n\n\n<li><strong>Mohamed Bendraouche<\/strong>,&nbsp;<strong>Mourad Boudhar<\/strong>&nbsp;and Ammar Oulamara. Scheduling: Agreement graph vs resource constraints. European Journal of Operational Research 240 (2),&nbsp; p. 355\u2013360, 2015.<\/li>\n\n\n\n<li><strong>Abdelhakim AIT ZAI<\/strong>&nbsp;and&nbsp;<strong>Mourad BOUDHAR<\/strong>. Parallel branch and bound and parallel PSO algorithm for scheduling problem with blocking. International Journal of Operational Research 16 (1), p. 14 \u2013 37, 2013.<\/li>\n<\/ol>\n<\/blockquote>\n\n\n\n<p><strong><u>Communications internationales :<\/u><\/strong><\/p>\n\n\n\n<blockquote class=\"wp-block-quote is-layout-flow wp-block-quote-is-layout-flow\">\n<ol style=\"background:linear-gradient(89deg,rgb(255,245,203) 0%,rgb(182,227,212) 50%,rgb(51,167,181) 100%)\" class=\"has-black-color has-text-color has-background has-link-color wp-block-list wp-elements-91ec28c4c1fecaa7c3ada4658c3d1d41\">\n<li>Rihane Karima, Adel Dabah &amp; Abdelhakim AitZai. Learning-based Selection process for Branch and Bound Algorithms \u00bb, 2022 IEEE Congress on Evolutionary Computation (CEC), 18-23 July 2022, Italy.<\/li>\n\n\n\n<li>Kenza Alioui, Karim Amrouche and Mourad Boudhar. Reentrant open shop scheduling problem with no-wait and time lags constraints. Conference TAMARICS\u20192022 (Trends and Advances in discrete MAthematics, operations Research, scientific Information and Computer Science). University of Tamanghasset, Algeria. December 08th-11th, 2022.<\/li>\n\n\n\n<li>Sarah Nouri and Mourad Boudhar. Equitable coloring and its applications in scheduling. Conference TAMARICS\u20192022 (Trends and Advances in discrete MAthematics, operations Research, scientific Information and Computer Science). University of Tamanghasset, Algeria. December 08th-11th, 2022.<\/li>\n\n\n\n<li>Ali Khebouche and Mourad Boudhar. Two-machine flow shop in reentrant and balanced linear robotic cells. Conference TAMARICS\u20192022 (Trends and Advances in discrete MAthematics, operations Research, scientific Information and Computer Science). University of Tamanghasset, Algeria. December 08th-11th, 2022.<\/li>\n\n\n\n<li>Amina Haned, Abida Kerdali and Mourad Boudhar. Scheduling interruptible tasks with preparation times. Conference TAMARICS\u20192022 (Trends and Advances in discrete MAthematics, operations Research, scientific Information and Computer Science). University of Tamanghasset, Algeria. December 08th-11th, 2022.<\/li>\n\n\n\n<li>Nazim Sami, Abdennour AZERINE and Mourad Boudhar. On the m-machine chain-reentrant flow shop with two agents. Conference TAMARICS\u20192022 (Trends and Advances in discrete MAthematics, operations Research, scientific Information and Computer Science). University of Tamanghasset, Algeria. December 08th-11th, 2022.<\/li>\n\n\n\n<li>Nadia Babou, Mourad Boudhar and Djamal Rebaine. Simulated annealing algorithm for a two-machine job shop problem with a single server and setup times. Conference TAMARICS\u20192022 (Trends and Advances in discrete MAthematics, operations Research, scientific Information and Computer Science). University of Tamanghasset, Algeria. December 08th-11th, 2022.<\/li>\n\n\n\n<li>Ali Khebouche and Mourad Boudhar. Optimisation du debit dans les cellules circulaires reentrantes \u00e0 deux machines. International Seminar on Industrial Engineering and Applied Mathematics (ISIEAM 2022). Skikda University (Algeria), October 23-24, 2022.<\/li>\n\n\n\n<li>Ali Khebouche and Mourad Boudhar. Flow shop robotis\u00e9 r\u00e9antrant \u00e0 trois machines. International Seminar on Industrial Engineering and Applied Mathematics (ISIEAM 2022). Skikda University (Algeria), October 23-24, 2022.<\/li>\n\n\n\n<li>Ali Khebouche and Mourad Boudhar. Flow shop robotis\u00e9 r\u00e9entrant \u00e0 deux machines. Colloque International MOAD\u20192022 (M\u00e9thodes et Outils d\u2019Aide \u00e0 la D\u00e9cision), 15 &#8211; 17 Novembre 2022, Universit\u00e9 de Bejaia.<\/li>\n\n\n\n<li>Asma RECIOUI and Abdelhakim Ait Zai. Defective K-Naple parking function of length n. Conference TAMARICS\u20192022 (Trends and Advances in discrete MAthematics, operations Research, scientific Information and Computer Science). University of Tamanghasset, Algeria. December 08th-11th, 2022.<\/li>\n\n\n\n<li>Mohamed Nedjai, Karim Amrouche and Mourad Boudhar. The two-stage chain reentrant hybrid flow-shop problem with deteriorating jobs. 50th Annual Conference of the Operations Research Society of South Africa ORSSA\u20192021, 12 &#8211; 15 September 2021, Cape Town.<\/li>\n\n\n\n<li>Abdennour Azerine, Mourad Boudhar and Djamal Rebaine. Two machine flow shop scheduling problem with two competing agents. 1st International Conference on Mathematics and Applications ICMA\u20192021, Dec 7-8 2021, Blida.<\/li>\n\n\n\n<li>Khaoula Bouakaz, Mourad Boudhar and Mohamed Bendraouche. Scheduling on batch processing machines with compatibility graph. 1st International Conference on Mathematics and Applications ICMA\u20192021, Dec 7-8 2021, Blida.<\/li>\n\n\n\n<li>Nouri Sarah and Boudhar Mourad. Scheduling on identical machines with conflict graphs. 1st International Conference on Mathematics and Applications ICMA\u20192021, Dec 7-8 2021, Blida.<\/li>\n\n\n\n<li>Nazim Sami Abdennour Azerine and Mourad Boudhar. The m-machine chain-reentrant flow shop with two agents. 1st International Conference on Mathematics and Applications ICMA\u20192021, Dec 7-8 2021, Blida.<\/li>\n\n\n\n<li>Nour Elhouda Tellache, Mourad Boudhar, Farouk Yalaoui. Open shop problem with agreement graph: new results. PMS\u20192021: 17th International workshop on Project Management and Scheduling. April 21-23, 2021, Toulouse (France).<\/li>\n\n\n\n<li>Amin Mallek and Mourad Boudhar. A branch-and-bound algorithm for the problem of scheduling with a conflict graph. International conference on decision aid sciences and applications (DASA&#8217;20), University of Bahrain, 8-9 November 2020.<\/li>\n\n\n\n<li>Tarek Menouer, Amina Khedimi, Christophe C\u00e9rin, Mohammed Chahbar. Scheduling Service Function Chains with Dependencies in the Cloud. CloudNet 2020 &#8211; Piscataway, NJ, USA, November 9-11, pages 1-3.<\/li>\n\n\n\n<li>Tarek Menouer, Amina Khedimi, Christophe C\u00e9rin. Smart Network Slices Scheduling in Cloud. SmartCloud 2020 \u2013 November 6-8, Washington DC, USA, pages 49-54.<\/li>\n\n\n\n<li>Azerine Abdennour, Boudhar Mourad and Rebaine Djamal. Two-machine job shop scheduling problem with two competing agents. International Conference on Artificial Intelligence and Information Technology, ICA2IT\u201919, March 4\u20136, 2019, Ouargla (Algeria).<\/li>\n\n\n\n<li>Djedjiga Ouiddir, Mourad Boudhar and Karima Bouibede Hocine. Just in time multicriteria scheduling problem in two-machine flow shop. International Conference on Artificial Intelligence and Information Technology, ICA2IT\u201919, March 4\u20136, 2019, Ouargla (Algeria).<\/li>\n\n\n\n<li>Nadia Babou, Mourad Boudhar and Djamal Rebaine. MIP models for a two-machine open shop problem and a server with setup times consideration. International Conference on Artificial Intelligence and Information Technology, ICA2IT\u201919, March 4\u20136, 2019, Ouargla (Algeria).<\/li>\n\n\n\n<li>Amin Mallek, Mohamed Bendraouche and Mourad Boudhar Scheduling conflicting jobs: application and new results. International Conference on Artificial Intelligence and Information Technology, ICA2IT\u201919, March 4\u20136, 2019, Ouargla (Algeria).<\/li>\n\n\n\n<li>Karim Amrouche, Mohamed Nedjai et Mourad Boudhar. Probl\u00e8me d\u2019ordonnancement d\u2019atelier de type chain-reentrant shop hybride avec t\u00e2ches d\u00e9t\u00e9riorables. Conference on Discrete Mathematics and Computer Science, DIMACOS\u20192019. Hammamet, Tunisia, October 26-29, 2019.<\/li>\n\n\n\n<li>AZERINE Abdennour, BOUDHAR Mourad and REBAINE Djamal. New Results on the Complexity of Proportionate shop. Conference on Discrete Mathematics and Computer Science, DIMACOS\u20192019. Hammamet, Tunisia, October 26-29, 2019.<\/li>\n\n\n\n<li>Amin Mallek, Mohamed Bendraouche and Mourad Boudhar. On the complexity of scheduling conflicting unit-time jobs on uniform machines. Conference on Discrete Mathematics and Computer Science, DIMACOS\u20192019. Hammamet, Tunisia, October 26-29, 2019.<\/li>\n\n\n\n<li>NOURI Sarah and BOUDHAR Mourad. Scheduling on identical machines with conflict graphs. Conference on Discrete Mathematics and Computer Science, DIMACOS\u20192019. Hammamet, Tunisia, October 26-29, 2019.<\/li>\n\n\n\n<li>Djedjiga OUIDDIR, Karima BOUIBEDE HOCINE and Mourad BOUDHAR. Multicriteria two-machine flow shop scheduling problem. Conference on Discrete Mathematics and Computer Science, DIMACOS\u20192019. Hammamet, Tunisia, October 26-29, 2019.<\/li>\n\n\n\n<li>Nadia Babou, Mourad Boudhar and Djamal Rebaine. Job shop problem with two machines and a single server for setting the jobs. Conference on Discrete Mathematics and Computer Science, DIMACOS\u20192019. Hammamet, Tunisia, October 26-29, 2019.<\/li>\n\n\n\n<li>Nazim SAMI, Karim AMROUCHE and Mourad BOUDHAR. Two-machine chain-reentrant shop with no-wait constraint. Conference on Discrete Mathematics and Computer Science, DIMACOS\u20192019. Hammamet, Tunisia, October 26-29, 2019.<\/li>\n\n\n\n<li>Nour El Houda TELLACHE, Mourad BOUDHAR &amp; Farouk YALAOUI. New Results for the Flow Shop problem with Conflict Graph. PGMO Days (Gaspard Monge Program for optimization, operations research and their interactions with data sciences), December 03-04, 2019 at EDF Labs Paris-Saclay.<\/li>\n\n\n\n<li>Nour El Houda Tellache, Mourad Boudhar. Scheduling with unit-time operations and conflict graphs. Tendances dans les Applications Math\u00e9matiques en Tunisie Alg\u00e9rie Maroc, TAMTAM\u20192019, Tlemcen les 23-27 F\u00e9vrier 2019.<\/li>\n\n\n\n<li>Azerine Abdennour, Boudhar Mourad, Rebaine Djamal. Ateliers \u00e0 cheminements multiples avec des agents comp\u00e9titifs. Tendances dans les Applications Math\u00e9matiques en Tunisie Alg\u00e9rie Maroc, TAMTAM\u20192019, Tlemcen les 23-27 F\u00e9vrier 2019.<\/li>\n\n\n\n<li>Nazim Sami, Karim Amrouche, Mourad Boudhar. 2 machine chain-reentrant shop with no-wait constraint. Tendances dans les Applications Math\u00e9matiques en Tunisie Alg\u00e9rie Maroc, TAMTAM\u20192019, Tlemcen les 23-27 F\u00e9vrier 2019.<\/li>\n\n\n\n<li><strong>Nadia BABOU<\/strong>,&nbsp;<strong>Mourad BOUDHAR<\/strong>&nbsp;and Djamal REBAINE. Scheduling with set-ups in an open shop environment. 6th IFIP International Conference on Computer Science and Its Applications, CIIA&#8217;2018. May 8-10 2018, USTO-MB Oran University, Oran, Algeria.<\/li>\n\n\n\n<li><strong>Karim AMROUCHE<\/strong>,&nbsp;<strong>Mourad BOUDHAR<\/strong>,&nbsp;<strong>Mohamed BENDRAOUCHE<\/strong>&nbsp;and&nbsp;<strong>Nazim SAMI<\/strong>. The two machines chain-reentrant shop with no-wait constraint: new results. TORS 2018. 7-9 avril 2018, Sousse (Tunisie).<\/li>\n\n\n\n<li><strong>Nadia BABOU<\/strong>,&nbsp;<strong>Mourad BOUDHAR<\/strong>&nbsp;and Djamal REBAINE. Open Shop problem with two machines, a single server and setup times. The 6th International Conference on Computer Intelligence and Its Applications (CIIA 2018). May 6-8, 2018, at USTO-MB in Oran, Algeria.<\/li>\n\n\n\n<li><strong>Karim AMROUCHE<\/strong>,&nbsp;<strong>Mourad BOUDHAR<\/strong>,&nbsp;<strong>Mohamed BENDAROUCHE<\/strong>&nbsp;and Farouk YALAOUI. R\u00e9solution d&#8217;un probl\u00e8me d&#8217;ordonnancement de type flowshop reentrant sans-attente. 18\u00e8me Conf\u00e9rence de la Soci\u00e9t\u00e9 Fran\u00e7aise de Recherche Op\u00e9rationnelle et d&#8217;Aide \u00e0 la D\u00e9cision, ROADEF&#8217;2017. 22 &#8211; 24 f\u00e9vrier 2017 \u00e0 Metz, France.<\/li>\n\n\n\n<li><strong>Adel DABAH<\/strong>, Ahc\u00e8ne BENDJOUDI,&nbsp;<strong>Abdelhakim AITZAI<\/strong>, Didier EL BAZ, Nadia NOUALI-TABOUDJEMAT. Multi and many-core parallel B&amp;B approaches for the Blocking Job Shop Scheduling problem. International Conference on High Performance Computing &amp; Simulation, HPCS 2016, Innsbruck, Austria, July 18-22, 2016. IEEE Computer Society 2016, ISBN 978-1-5090-2088-1. Pages 705-712.<\/li>\n\n\n\n<li><strong>Adel DABAH<\/strong>, Ahc\u00e8ne BENDJOUDI,&nbsp;<strong>Abdelhakim AITZAI<\/strong>. Efficient parallel B&amp;B method for the blocking job shop scheduling problem. International Conference on High Performance Computing &amp; Simulation, HPCS 2016, Innsbruck, Austria, July 18-22, 2016. IEEE Computer Society 2016, ISBN 978-1-5090-2088-1. Pages 784-791.<\/li>\n\n\n\n<li><strong>Adel DABAH<\/strong>, Ahc\u00e8ne BENDJOUDI, Didier EL BAZ,&nbsp;<strong>Abdelhakim AITZAI<\/strong>. GPU-Based Two Level Parallel B&amp;B for the Blocking Job Shop Scheduling Problem. International Parallel and Distributed Processing Symposium Workshops (IPDPSW 2016), Chicago, IL, USA, May 23-27, 2016. IEEE Computer Society 2016, ISBN 978-1-5090-3682-0. Pages 747-755.<\/li>\n\n\n\n<li><strong>Karim AMROUCHE<\/strong>,&nbsp;<strong>Mourad BOUDHAR<\/strong>&nbsp;and Farouk YALAOUI. The chain-reentrant shop with the no-wait constraint. 8th IFAC Conference on Manufacturing Modelling, Management and Control, MIM&#8217;2016, Troyes (France), June 28-30, 2016.<\/li>\n\n\n\n<li><strong>Nour El Houda TELLACHE<\/strong>&nbsp;and&nbsp;<strong>Mourad BOUDHAR<\/strong>. The two-machine flow shop problem with conflict graphs. 8th IFAC Conference on Manufacturing Modelling, Management and Control, MIM&#8217;2016, Troyes (France), June 28-30, 2016.<\/li>\n\n\n\n<li><strong>Nadjat MEZIANI<\/strong>, Ammar OULAMARA et&nbsp;<strong>Mourad BOUDHAR<\/strong>. OEP et recuit simul\u00e9 pour le probl\u00e8me du flowshop \u00e0 deux machines avec des op\u00e9rations coupl\u00e9es. 17<sup>\u00e8me<\/sup>&nbsp;conf\u00e9rence de la soci\u00e9t\u00e9 Fran\u00e7aise de Recherche Op\u00e9rationnelle et &nbsp;Aide \u00e0 la D\u00e9cision (ROADEF), 10-12 F\u00e9vrier 2016, Marseille, France.<\/li>\n\n\n\n<li><strong>Nadjat MEZIANI<\/strong>, Ammar OULAMARA et&nbsp;<strong>Mourad BOUDHAR<\/strong>. Probl\u00e8me du flowshop \u00e0 deux machines avec des op\u00e9rations coupl\u00e9es sur la premi\u00e8re machine. 16<sup>\u00e8me<\/sup>&nbsp;conf\u00e9rence de la soci\u00e9t\u00e9 Fran\u00e7aise de Recherche Op\u00e9rationnelle et Aide \u00e0 la D\u00e9cision (ROADEF), 25-27 F\u00e9vrier 2015, Marseille, France.<\/li>\n\n\n\n<li><strong>Karim AMROUCHE<\/strong>,&nbsp;<strong>Mourad BOUDHAR<\/strong>&nbsp;and Farouk YALAOUI. A Multi start descent heuristic for a chain-reentrant shop. MIC 2015: The XI Metaheuristics International Conference. June 7-10, 2015. Agadir, Morocco.<\/li>\n\n\n\n<li><strong>Nadjat MEZIANI<\/strong>, Ammar OULAMARA et&nbsp;<strong>Mourad BOUDHAR<\/strong>. Probl\u00e8me du flowshop \u00e0 deux machines avec des op\u00e9rations coupl\u00e9es sur la premi\u00e8re machine. 6<sup>th&nbsp;<\/sup>Operational Research Practice in Africa Conference (ORPA&#8217;2015), 20-22 Avril 2015, USTHB, Algiers, Algeria.<\/li>\n\n\n\n<li><strong>Nour El Houda TELLACHE<\/strong>&nbsp;&amp;&nbsp;<strong>Mourad BOUDHAR<\/strong>. Flow-shop scheduling problem with conflict graphs. 6<sup>th&nbsp;<\/sup>Operational Research Practice in Africa Conference (ORPA&#8217;2015), 20-22 Avril 2015, USTHB, Algiers, Algeria.<\/li>\n\n\n\n<li><strong>Karim AMROUCHE<\/strong>,&nbsp;<strong>Mourad BOUDHAR<\/strong>&nbsp;&amp; Farouk YALAOUI. Complexity results of a chain reentrante shop with an exact time lag. 6<sup>th&nbsp;<\/sup>Operational Research Practice in Africa Conference (ORPA&#8217;2015), 20-22 Avril 2015, USTHB, Algiers, Algeria.<\/li>\n\n\n\n<li><strong>Amine MOHABEDDINE<\/strong>,&nbsp;<strong>Mourad BOUDHAR<\/strong>&nbsp;&amp; Ammar OULAMARA. Ordonnancement sur deux machines avec contraintes de concordance : machines identiques et uniformes. 6<sup>th&nbsp;<\/sup>Operational Research Practice in Africa Conference (ORPA&#8217;2015), 20-22 Avril 2015, USTHB, Algiers, Algeria.<\/li>\n\n\n\n<li><strong>Ryma Zineb BADAOUI<\/strong>,&nbsp;<strong>Mourad BOUDHAR<\/strong>&nbsp;&amp; Mohammed DAHANE. Algorithmes exacts et approch\u00e9s pour le probl\u00e8me d&#8217;ordonnancement pr\u00e9emptif sur machines parall\u00e8les avec d\u00e9lais de transport. 6<sup>th&nbsp;<\/sup>Operational Research Practice in Africa Conference (ORPA&#8217;2015), 20-22 Avril 2015, USTHB, Algiers, Algeria.<\/li>\n\n\n\n<li>Karima BOUIBEDE-HOCINE,&nbsp;<strong>Drifa HETAK<\/strong>&nbsp;&amp;&nbsp;<strong>Mourad BOUDHAR.<\/strong>&nbsp;A Tabu Search and a Genetic Algorithm for solving a Bicriteria Parallel Machine Scheduling Problem. 6<sup>th&nbsp;<\/sup>Operational Research Practice in Africa Conference (ORPA&#8217;2015), 20-22 Avril 2015, USTHB, Algiers, Algeria.<\/li>\n\n\n\n<li><strong>Nour El Houda TELLACHE<\/strong>&nbsp;and&nbsp;<strong>Mourad BOUDHAR<\/strong>. Open shop scheduling problems with conflict graphs. Colloque sur l&#8217;Optimisation et les Syst\u00e8mes d&#8217;Information (COSI&#8217;2015), du 01 au 03 Juin 2015, Universit\u00e9 d&#8217;oran 1, Oran, Alg\u00e9rie.&nbsp;<\/li>\n\n\n\n<li><strong>karim AMROUCHE<\/strong>,&nbsp;<strong>Mourad BOUDHAR<\/strong>&nbsp;et Farouk YALAOUI. R\u00e9solution approch\u00e9e d&#8217;un probl\u00e8me d&#8217;ordonnancement de type flowshop continu avec recirculation. Conference-School on Discrete Mathematics and Computer Science (DIMACOS&#8217;2015), 15-19 novembre 2015, Sidi Bel Abb\u00e8s, Alg\u00e9rie.<\/li>\n\n\n\n<li><strong>Amina HANED<\/strong>&nbsp;and&nbsp;<strong>Mourad BOUDHAR<\/strong>. Scheduling with preemption and setup times. Conference-School on Discrete Mathematics and Computer Science (DIMACOS&#8217;2015), 15-19 novembre 2015, Sidi Bel Abb\u00e8s, Alg\u00e9rie.<\/li>\n\n\n\n<li><strong>Nour El Houda TELLACHE<\/strong>&nbsp;et&nbsp;<strong>Mourad BOUDHAR<\/strong>. Scheduling the two-machine flow shop problem with unit-time operations and conflict graph. Conference-School on Discrete Mathematics and Computer Science (DIMACOS&#8217;2015), 15-19 novembre 2015, Sidi Bel Abb\u00e8s, Alg\u00e9rie.<\/li>\n\n\n\n<li><strong>Nadjat MEZIANI<\/strong>,&nbsp;<strong>Mourad BOUDHAR<\/strong>&nbsp;and Ammar OULAMARA. PSO and Simulated annealing for the two machines flowshop scheduling problem with coupled-operations. Conference-School on Discrete Mathematics and Computer Science (DIMACOS&#8217;2015), 15-19 novembre 2015, Sidi Bel Abb\u00e8s, Alg\u00e9rie.<\/li>\n\n\n\n<li><strong>Nadjat MEZIANI<\/strong>, Ammar OULAMARA et&nbsp;<strong>Mourad BOUDHAR<\/strong>. NP-compl\u00e9tude du probl\u00e8me du flowshop \u00e0 deux machines avec des op\u00e9rations coupl\u00e9es. Tunisian Operational Research Society conference (TORS&#8217;15), 12-14 Juin 2015, Sousse, Tunisia.<\/li>\n\n\n\n<li><strong>Nadjat MEZIANI<\/strong>, Ammar OULAMARA et&nbsp;<strong>Mourad BOUDHAR<\/strong>. NP-compl\u00e9tude du probl\u00e8me du flowshop \u00e0 deux machines avec des op\u00e9rations coupl\u00e9es. Conf\u00e9rence Internationale de Conception et Production Int\u00e9gr\u00e9e (CPI 2015), 2-4 d\u00e9cembre 2015, Tanger, Maroc.<\/li>\n\n\n\n<li><strong>Amina HANED<\/strong>&nbsp;and&nbsp;<strong>Mourad BOUDHAR<\/strong>. Metaheuristics for the resolution of a scheduling problem with preemption and transportation delays. International Conference on Industrial Engineering and Manufacturing, ICIEM&#8217;14, du 11 au 13 mai 2014 \u00e0 Batna, Alg\u00e9rie.<\/li>\n\n\n\n<li><strong>Mohamed BENDRAOUCHE<\/strong>&nbsp;and&nbsp;<strong>Mourad BOUDHAR<\/strong>. Scheduling with agreements: recent results. COSI (Colloque sur l&#8217;Optimisation et les Syst\u00e8mes d&#8217;Information), du 08 au 10 Juin 2014, Universit\u00e9 de B\u00e9jaia,<\/li>\n\n\n\n<li><strong>Mohamed BENDRAOUCHE<\/strong>&nbsp;and&nbsp;<strong>Mourad BOUDHAR<\/strong>. Scheduling with agreement graph vs ressource contraints. 26th European Conference on Operational Research (EURO\/INFORMS MMXIII), Rome (Italie), 01-04 Juillet 2013.<\/li>\n\n\n\n<li><strong>Wafaa LABBI<\/strong>,&nbsp;<strong>Mourad BOUDHAR<\/strong>&nbsp;and&nbsp;<strong>Ammar OULAMARA<\/strong>. Scheduling on two identical machines with preparation times. 26<sup>th<\/sup>&nbsp;Conference of the European Chapter on Combinatorial Optimization (ECCO&#8217;13), May 30- June 1, 2013, Paris, France.<\/li>\n\n\n\n<li><strong>Wafaa LABBI<\/strong>,&nbsp;<strong>Mourad BOUDHAR<\/strong>&nbsp;and&nbsp;<strong>Ammar OULAMARA<\/strong>. Metaheuristics for scheduling on two identical machines with preparation times. 26th European Conference on Operational Research (EURO\/INFORMS MMXIII), Rome (Italy), July 1-4, 2013.<\/li>\n\n\n\n<li><strong>Karim AMROUCHE<\/strong>&nbsp;and&nbsp;<strong>Mourad BOUDHAR<\/strong>. A genetic algorithm for a chain-reentrant shops with an exact time lag. 26th European Conference on Operational Research (EURO\/INFORMS MMXIII), Rome (Italy), July 1-4, 2013.<\/li>\n\n\n\n<li><strong>Karim AMROUCHE<\/strong>&nbsp;and&nbsp;<strong>Mourad BOUDHAR<\/strong>. Two machines flow shop with reentrance and exact time lag. Multidisciplinary International Scheduling Conference (MISTA 2013). 27-29 august 2013, Ghent (Belgium).<\/li>\n\n\n\n<li><strong>Abdelhakim AITZAI<\/strong>,&nbsp;<strong>Mourad BOUDHAR<\/strong>&nbsp;and&nbsp;<strong>Adel DABAH<\/strong>. Parallel CPU and GPU computations to solve the job shop scheduling problem with blocking. IEEE High Performance Extreme Computing Conference (IEEE-HPEC&#8217;13), 10-12 September 2013. Boston, Massachusetts, USA.<\/li>\n\n\n\n<li><strong>Mohamed BENDRAOUCHE<\/strong>&nbsp;et&nbsp;<strong>Mourad BOUDHAR<\/strong>. Etude de deux probl\u00e8mes d&#8217;ordonnancement : avec graphe de concordance et \u00e0 contraintes de ressources. 8\u00e8me Conf\u00e9rence Internationale : Conception &amp; Production Int\u00e9gr\u00e9es (CPI 2013), Tlemcen, 21-23 octobre 2013.<\/li>\n\n\n\n<li><strong>Amina HANED<\/strong>&nbsp;and&nbsp;<strong>Mourad BOUDHAR<\/strong>. A genetic algorithm for scheduling problem with preemption and transportation delays. 8\u00e8me Conf\u00e9rence Internationale&nbsp;: Conception &amp; Production Int\u00e9gr\u00e9es (CPI 2013), Tlemcen, 21-23 octobre 2013.<\/li>\n\n\n\n<li><strong>Nadjat MEZIANI<\/strong>, Ammar OULAMARA and&nbsp;<strong>Mourad BOUDHAR<\/strong>. Resolution of the coupled-tasks problem on two machines flow shop with the particle swarm optimization. Premier Symposium International en Recherche Op\u00e9rationnelle et ses Applications (ISORAP&#8217;2013), 08-10 Mai 2013, Marrakech (Maroc).<\/li>\n\n\n\n<li><strong>Nadjat MEZIANI<\/strong>, Ammar OULAMARA and&nbsp;<strong>Mourad BOUDHAR<\/strong>. PSO for the two machines flow shop with the coupled-tasks. Dixi\u00e8me \u00e9dition du Colloque sur l&#8217;Optimisation et les Syst\u00e8mes d&#8217;Information (COSI&#8217;2013), 9-11 Juin 2013, Alger, Alg\u00e9rie.<\/li>\n\n\n\n<li><strong>Abdelhakim AIT ZAI<\/strong>, Brahim BENMEJDOUB and&nbsp;<strong>Mourad BOUDHAR<\/strong>. Probl\u00e8me de job shop avec la contrainte de sans attente. Conf\u00e9rence de la soci\u00e9t\u00e9 Fran\u00e7aise de Recherche Op\u00e9rationnelle et Aide \u00e0 la D\u00e9cision (ROADEF 2013), Troyes (France), 13-15 f\u00e9vrier 2013.<\/li>\n\n\n\n<li>Karima BOUIBEDE,&nbsp;<strong>Abdelhakim AIT ZAI<\/strong>, Mohamed LAKEHAL and&nbsp;<strong>Adel DABAH<\/strong>. Bicriteria Scheduling Problem of Job-Shop with Blocking. 8\u00e8me Conf\u00e9rence Internationale : Conception &amp; Production Int\u00e9gr\u00e9es (CPI 2013), Tlemcen, 21-23 octobre 2013.<\/li>\n\n\n\n<li><strong>Abdelhakim AIT ZAI<\/strong>&nbsp;et&nbsp;<strong>Adel DABAH<\/strong>. Recherche Taboue pour le probl\u00e8me d&#8217;ordonnancement job shop avec contrainte de blocage. 8\u00e8me Conf\u00e9rence Internationale : Conception &amp; Production Int\u00e9gr\u00e9es (CPI 2013), Tlemcen, 21-23 octobre 2013.<\/li>\n<\/ol>\n<\/blockquote>\n\n\n\n<p><strong><u>Communications nationales :<\/u><\/strong><\/p>\n\n\n\n<blockquote class=\"wp-block-quote is-layout-flow wp-block-quote-is-layout-flow\">\n<ol style=\"background:linear-gradient(89deg,rgb(255,245,203) 0%,rgb(182,227,212) 50%,rgb(51,167,181) 100%)\" class=\"has-black-color has-text-color has-background has-link-color wp-block-list wp-elements-06269f35b96514eea58ebf01f5bcdbf6\">\n<li>Ali Khebouche, Mourad Boudhar. Ordonnancement flow shop \u00e0 trois machines dans des cellules circulaires robotis\u00e9es r\u00e9entrantes et \u00e9quilibr\u00e9es. Journ\u00e9es Scientifiques du Laboratoire RECITS, JSL\u20192022. 15-16 octobbre 2022, Alger.<\/li>\n\n\n\n<li>Haned Amina, Boudhar Mourad. A Genetic Algorithm For Scheduling Problem With Preemption And Setup Times. Journ\u00e9es Scientifiques du Laboratoire RECITS, JSL\u20192022. 15-16 octobbre 2022, Alger.<\/li>\n\n\n\n<li>Kenza Alioui, Karim Amrouche, Mourad Boudhar. Probl\u00e8me d\u2019ordonnancement de type open shop r\u00e9entrant avec contraintes de latence et sans attente. Journ\u00e9es Scientifiques du Laboratoire RECITS, JSL\u20192022. 15-16 octobbre 2022, Alger.<\/li>\n\n\n\n<li>Bouakaz Khaoula, Boudhar Mourad, Bendraouche Mohamed. Scheduling on batch processing machines with compatibility graph. Journ\u00e9es Scientifiques du Laboratoire RECITS, JSL\u20192022. 15-16 octobbre 2022, Alger.<\/li>\n\n\n\n<li>Nedjai Mohamed, Boudhar Mourad, Amrouche Karim. The Two-Stage Chain Reentrant Hybrid Flow-Shop Problem With Deteriorating Jobs. Journ\u00e9es Scientifiques du Laboratoire RECITS, JSL\u20192022. 15-16 octobbre 2022, Alger.<\/li>\n\n\n\n<li>Abdennour Azerine, Mourad Boudhar and Djamal Rebaine. The two-agent no-wait flow shop problem with makespan criteria. Journ\u00e9es Scientifiques du Laboratoire RECITS, JSL\u20192021. 11-12 d\u00e9cembre 2021, Alger.<\/li>\n\n\n\n<li>Sarah Nouri and Mourad Boudhar. Equitable coloring and scheduling on identical machines. Journ\u00e9es Scientifiques du Laboratoire RECITS, JSL\u20192021. 11-12 d\u00e9cembre 2021, Alger.<\/li>\n\n\n\n<li>Nazim Sami, Abdennour Azerine and Mourad Boudhar. Meta-heuristics for the m-machine chain-reentrant flow shop with two agents. Journ\u00e9es Scientifiques du Laboratoire RECITS, JSL\u20192021. 11-12 d\u00e9cembre 2021, Alger.<\/li>\n\n\n\n<li>Khaoula Bouakaz, Mourad Boudhar and Mohamed Bendraouche. Scheduling on batch processing machines with compatibility graph. Journ\u00e9es Scientifiques du Laboratoire RECITS, JSL\u20192021. 11-12 d\u00e9cembre 2021, Alger.<\/li>\n\n\n\n<li>Amina Haned and Mourad Boudhar. Scheduling on identical machines with preemption and setup times. Journ\u00e9es Scientifiques du Laboratoire RECITS, JSL\u20192021. 11-12 d\u00e9cembre 2021, Alger.<\/li>\n\n\n\n<li>Ali Khebouche et Mourad Boudhar. Analyse du temps de cycle de production dans des cellules circulaires robotis\u00e9es r\u00e9entrantes avec capacit\u00e9 de permutation. Journ\u00e9es Scientifiques du Laboratoire RECITS, JSL\u20192021. 11-12 d\u00e9cembre 2021, Alger.<\/li>\n\n\n\n<li>Djedjiga Ouiddir et Mourad Boudhar. Ordonnancement multicrit\u00e8re dans un flow shop \u00e0 deux machines. Journ\u00e9es Scientifiques du Laboratoire RECITS, JSL\u20192021. 11-12 d\u00e9cembre 2021, Alger.<\/li>\n\n\n\n<li>Lakehal Soumaya et Ait Zai Abdelhakim M\u00e9taheuristiques pour la r\u00e9solution du CFLP. Journ\u00e9es Scientifiques du Laboratoire RECITS, JSL\u20192021. 11-12 d\u00e9cembre 2021, Alger.<\/li>\n\n\n\n<li>Boudhar Mourad. Graphes et ordonnancement. S\u00e9minaire du GERAD (Groupe d\u2019Etudes et de Recherche en Analyse des D\u00e9cisions). Universit\u00e9 de Montr\u00e9al, Canada. 21 novembre 2019.<\/li>\n<\/ol>\n<\/blockquote>\n\n\n\n<p><strong><u>Organisation de Conf\u00e9rences :<\/u><\/strong><\/p>\n\n\n\n<blockquote class=\"wp-block-quote has-black-color has-text-color has-link-color wp-elements-7de7626780daa7819ec0ff2e3c8c1908 is-layout-flow wp-block-quote-is-layout-flow\">\n<ol style=\"background:linear-gradient(89deg,rgb(255,245,203) 0%,rgb(182,227,212) 50%,rgb(51,167,181) 100%)\" class=\"has-background wp-block-list\">\n<li>(Boudhar Mourad et Ait Zai Abdelhakim) : Membres du comit\u00e9 technique de programme de la conference TAMARICS\u20192022 (Trends and Advances in discrete MAthematics, operations Research, scientific Information and Computer Science), December 04th-08th, 2022, University of Tamanghasset, Algeria.<\/li>\n\n\n\n<li>Boudhar Mourad : Membre du Comit\u00e9 de Programme du Colloque International MOAD\u20192022 (M\u00e9thodes et Outils d\u2019Aide \u00e0 la D\u00e9cision) Universit\u00e9 de B\u00e9jaia, 15 &#8211; 17 Novembre 2022.<\/li>\n\n\n\n<li>(Boudhar Mourad, Ait Zai Abdelhakim, Bendraouche Mohamed et Amrouche Karim) : Membres du comit\u00e9 scientifique des Journ\u00e9es Scientifiques du Laboratoire RECITS, JSL\u20192022, 15-16 octobre 2022, USTHB.<\/li>\n\n\n\n<li>(Babou Nadia, Boudhar Mourad, Nouri Sarah et Sami Nazim) : Membres du comit\u00e9 d\u2019organisation des Journ\u00e9es Scientifiques du Laboratoire RECITS, JSL\u20192022, 15-16 octobre 2022, USTHB.<\/li>\n\n\n\n<li>Amrouche Karim : Pr\u00e9sident du comit\u00e9 d\u2019organisation des Journ\u00e9es Scientifiques du Laboratoire RECITS, JSL\u20192022, 15-16 octobre 2022, USTHB.<\/li>\n\n\n\n<li>Boudhar Mourad : Membre du comit\u00e9 scientifique de 1st International Conference on Mathematics and Applications ICMA\u20192021, Dec 7-8 2021, Blida.<\/li>\n\n\n\n<li>(Boudhar Mourad, Ait Zai Abdelhakim et Bendraouche Mohamed) : Membres du comit\u00e9 scientifique des Journ\u00e9es Scientifiques du Laboratoire RECITS, JSL\u20192021, USTHB.<\/li>\n\n\n\n<li>(Ait Zai Abdelhakim, Azerine Abdenour, Babou Nadia, Nouri Sarah et Sami Nazim) : Membres du comit\u00e9 d\u2019organisation des Journ\u00e9es Scientifiques du Laboratoire RECITS, JSL\u20192021, USTHB.<\/li>\n\n\n\n<li>Boudhar Mourad : Pr\u00e9sident du comit\u00e9 d\u2019organisation des Journ\u00e9es Scientifiques du Laboratoire RECITS, JSL\u20192021, USTHB.<\/li>\n\n\n\n<li>Boudhar Mourad : Membre du comit\u00e9 scientifique et du comit\u00e9 d\u2019organisation \u00ab Conference on Discrete Mathematics and Computer Science DIMACOS&#8217;2019 \u00bb. Hammamet, Tunisia. 26-29 october 2019.<\/li>\n\n\n\n<li>Boudhar Mourad : Membre du comit\u00e9 scientifique du Colloque sur l&#8217;Optimisation et les Syst\u00e8mes d&#8217;Information COSI&#8217;2019, 24 &#8211; 26 Juin 2019, Tizi Ouzou (Alg\u00e9rie).<\/li>\n\n\n\n<li>Boudhar Mourad : Membre du comit\u00e9 scientifique de International Conference on Artificial Intelligence and Information Technology, ICA2IT\u201919, March 4\u20136, 2019, Ouargla (Algeria).<\/li>\n<\/ol>\n<\/blockquote>\n\n\n\n<p><strong><u>Soutenances de th\u00e8ses et d&#8217;habilitations universitaires<\/u><\/strong><\/p>\n\n\n\n<blockquote class=\"wp-block-quote is-layout-flow wp-block-quote-is-layout-flow\">\n<ol style=\"background:linear-gradient(89deg,rgb(255,245,203) 0%,rgb(182,227,212) 50%,rgb(51,167,181) 100%)\" class=\"has-black-color has-text-color has-background has-link-color wp-block-list wp-elements-157d35471a2df270cd7d5eb36b0a785c\">\n<li>Nouri Sarah. Coloration \u00e9quitable et applications. Dipl\u00f4me de Doctorat en recherche op\u00e9rationnelle et math\u00e9matiques discr\u00e8tes. Soutenu le 23 mars 2023 \u00e0 l\u2019USTHB. (Directeur de th\u00e8se : Boudhar Mourad et Bendraouche Mohamed)<\/li>\n\n\n\n<li>Lakehal Soumaya. Typologie des syst\u00e8mes cellulaires de production : agencement de l\u2019espace. Dipl\u00f4me de Doctorat en recherche op\u00e9rationnelle et math\u00e9matiques discr\u00e8tes. Soutenu le 24 f\u00e9vrier 2022 \u00e0 l\u2019USTHB. (Directeur de th\u00e8se : Ait Zai Abdelhakim)<\/li>\n\n\n\n<li>Azerine Abdenour. Ordonnancement d&#8217;atelier de type multi-agents. Dipl\u00f4me de Doctorat en recherche op\u00e9rationnelle et math\u00e9matiques discr\u00e8tes. Soutenu le 18 d\u00e9cembre 2021 \u00e0 l\u2019USTHB. (Directeurs de th\u00e8se : Boudhar Mourad et Rebaine Djamal)<\/li>\n\n\n\n<li>Babou Nadia. Ordonnancement d\u2019atelier avec temps de pr\u00e9paration. Dipl\u00f4me de Doctorat en recherche op\u00e9rationnelle et math\u00e9matiques discr\u00e8tes. Soutenu le 13 octobre 2021 \u00e0 l\u2019USTHB. (Directeurs de th\u00e8se : Boudhar Mourad et Rebaine Djamal)<\/li>\n\n\n\n<li>Tigane Meriem. Ordonnancement et gestion d\u2019\u00e9nergie. Dipl\u00f4me de Doctorat en recherche op\u00e9rationnelle. Soutenu le 06 f\u00e9vrier 2021 \u00e0 l&#8217;U.S.T.H.B. (Directeurs de th\u00e8se : Boudhar Mourad et Dahane Mohammed)<\/li>\n\n\n\n<li>Badaoui Ryma Zineb. Ordonnancement pr\u00e9emptif avec d\u00e9lai de transport. Dipl\u00f4me de Doctorat LMD en recherche op\u00e9rationnelle. Soutenu le 17 juillet 2021 \u00e0 l&#8217;U.S.T.H.B. (Directeurs de th\u00e8se : Boudhar Mourad et Dahane Mohammed)<\/li>\n\n\n\n<li>Mallek Amin. Ordonnancement des t\u00e2ches compatibles sur des machines parall\u00e8les. Dipl\u00f4me de Doctorat en recherche op\u00e9rationnelle et math\u00e9matiques discr\u00e8tes. Soutenue le 21 juin 2020 \u00e0 l\u2019USTHB. (Directeurs de th\u00e8se : Boudhar Mourad et Bendraouche Mohamed)<\/li>\n\n\n\n<li>MOHABEDDINE Amine. Ordonnancement en pr\u00e9sence de t\u00e2ches concordantes. Dipl\u00f4me de Doctorat en recherche op\u00e9rationnelle et math\u00e9matiques discr\u00e8tes, soutenu le 18 d\u00e9cembre 2019 \u00e0 l&#8217;U.S.T.H.B. (Directeur de th\u00e8se : Boudhar Mourad)<\/li>\n\n\n\n<li><strong>Nadjat MEZIANI<\/strong>. Flowshop a deux machines en pr\u00e9sence de taches coupl\u00e9es avec temps de latence exacts. Doctorat en Math\u00e9matiques, option : Recherche Op\u00e9rationnelle. Soutenue \u00e0 l&#8217;USTHB le 24 juin 2018. (Directeur de th\u00e8se :&nbsp;<strong>Mourad Boudhar<\/strong>)<\/li>\n\n\n\n<li><strong>Adel DABAH<\/strong>. M\u00e9thodes de r\u00e9solution parall\u00e8les sur environnement hybride, Multi-Core et GPU pour le probl\u00e8me job shop avec la contrainte de blocage.Doctorat en Informatique, option : Intelligence artificielle et Ing\u00e9nierie de logiciels. Soutenue \u00e0 l&#8217;USTHB le 19 juin 2018. (Directeur de th\u00e8se :&nbsp;<strong>Abdelhakim AitZai<\/strong>)<\/li>\n\n\n\n<li><strong>Nour El-Houda TELLACHE<\/strong>. Ordonnancement d&#8217;atelier en pr\u00e9sence d&#8217;un graphe de conflits. Doctorat en Recherche Op\u00e9rationnelle et Math\u00e9matiques Discr\u00e8tes. Soutenue \u00e0 l&#8217;USTHB le 16 mars 2017 sous la direction du Pr.&nbsp;<strong>Mourad BOUDHAR<\/strong>.<\/li>\n\n\n\n<li><strong>Karim AMROUCHE<\/strong>. Ordonnancement sur une ligne de production avec recirculation. Doctorat en Recherche Op\u00e9rationnelle. Soutenue \u00e0 l&#8217;USTHB le 06 janvier 2016 sous la direction du Pr.&nbsp;<strong>Mourad BOUDHAR<\/strong>.<\/li>\n\n\n\n<li><strong>Mohamed BENDRAOUCHE<\/strong>. Habilitation Universitaire soutenue le 18 mars 2015 \u00e0 l&#8217;USTHB.<\/li>\n\n\n\n<li><strong>Wafaa LABBI<\/strong>. Ordonnancement sous contraintes de pr\u00e9paration. Doctorat. Soutenue \u00e0 l&#8217;USTHB le 04 mars 2015 sous la direction du Pr.&nbsp;<strong>Mourad BOUDHAR<\/strong>&nbsp;et Ammar OULAMARA.<\/li>\n\n\n\n<li><strong>Abdelhakim AITZAI<\/strong>. Habilitation Universitaire soutenue le 16 juin 2014 \u00e0 l&#8217;USTHB.<\/li>\n\n\n\n<li><strong>Drifa HETTAK<\/strong>. R\u00e9solution d&#8217;un probl\u00e8me d&#8217;ordonnancement bicrit\u00e8re \u00e0 machines parall\u00e8les. Magister. Soutenue \u00e0 l&#8217;USTHB le 15 janvier 2013 sous la direction du Pr.&nbsp;<strong>Mourad BOUDHAR<\/strong>.<\/li>\n<\/ol>\n<\/blockquote>\n\n\n\n<p><strong>Les membres de l&#8217;\u00e9quipe ont particip\u00e9 aussi \u00e0 de nombreuses publications nationales, communications nationales, soutenances de master et de licence et d&#8217;organisation de manifestations scientifiques nationales et internationales.<\/strong><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Equipe Recherche Op\u00e9rationnelle pour le Transport et l&#8217;ordonnancement en Productique Responsable Pr. BOUDHAR Mourad Mail mboudhar@usthb.dz Pr\u00e9sentation RO-TOP est une \u00e9quipe de recherche qui s&#8217;int\u00e9resse \u00e0 l&#8217;optimisation des syst\u00e8mes de production qui regroupe l&#8217;ensemble des activit\u00e9s qui ont pour objectif <span class=\"readmore\"><a href=\"https:\/\/lrecits.usthb.dz\/index.php\/recherche-operationnelle-pour-le-transport-et-lordonnancement-en-productique-ro-top\/\">Continue Reading<\/a><\/span><\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-58","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/lrecits.usthb.dz\/index.php\/wp-json\/wp\/v2\/pages\/58","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/lrecits.usthb.dz\/index.php\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/lrecits.usthb.dz\/index.php\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/lrecits.usthb.dz\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/lrecits.usthb.dz\/index.php\/wp-json\/wp\/v2\/comments?post=58"}],"version-history":[{"count":5,"href":"https:\/\/lrecits.usthb.dz\/index.php\/wp-json\/wp\/v2\/pages\/58\/revisions"}],"predecessor-version":[{"id":354,"href":"https:\/\/lrecits.usthb.dz\/index.php\/wp-json\/wp\/v2\/pages\/58\/revisions\/354"}],"wp:attachment":[{"href":"https:\/\/lrecits.usthb.dz\/index.php\/wp-json\/wp\/v2\/media?parent=58"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}