Dynamic Scheduling on a Single Batch Processing Machine with Split Compatibility Graphs. - Mourad Boudhar (J. Math. Model. Algorithms, 2003)

Scheduling a batch processing machine with bipartite compatibility graphs. - Mourad Boudhar (Math. Methods Oper. Res., 2003)

Scheduling on a Batch Processing Machine with Split Compatibility Graphs. - Mourad Boudhar (J. Math. Model. Algorithms, 2005)

Preemptive scheduling in the presence of transportation times. - Mourad Boudhar; Amina Haned (Comput. Oper. Res., 2009)

Two-stage hybrid flow shop with recirculation. - Mourad Boudhar; Nadjat Meziani (Int. Trans. Oper. Res., 2010)

Two machine Flow shop with transportation time. - Mourad Boudhar; Nacira Chikhi (Stud. Inform. Univ., 2011)

Scheduling jobs on identical machines with agreement graph. - Mohamed Bendraouche; Mourad Boudhar (Comput. Oper. Res., 2012)

Scheduling on parallel machines with preemption and transportation delays. - Amina Haned; Ameur Soukhal; Mourad Boudhar; Nguyen Huynh Tuong (Comput. Oper. Res., 2012)

Scheduling: Agreement graph vs resource constraints. - Mohamed Bendraouche; Mourad Boudhar; Ammar Oulamara (Eur. J. Oper. Res., 2015)

Branch-and-bound and PSO algorithms for no-wait job shop scheduling. - Abdelhakim AitZai; Brahim Benmedjdoub; Mourad Boudhar (J. Intell. Manuf., 2016)

Two machines flow shop with reentrance and exact time lag. - Karim Amrouche; Mourad Boudhar (RAIRO Oper. Res., 2016)

Open shop scheduling problems with conflict graphs. - Nour El Houda Tellache; Mourad Boudhar (Discret. Appl. Math., 2017)

Chain-reentrant shop with an exact time lag: new results. - Karim Amrouche; Mourad Boudhar; Mohamed Bendraouche; Farouk Yalaoui (Int. J. Prod. Res., 2017)

Scheduling two identical parallel machines with preparation constraints. - Wafaa Labbi; Mourad Boudhar; Ammar Oulamara (Int. J. Prod. Res., 2017)

Two-machine flow shop problem with unit-time operations and conflict graph. - Nour El Houda Tellache; Mourad Boudhar (Int. J. Prod. Res., 2017)

Flow shop scheduling problem with conflict graphs. - Nour El Houda Tellache; Mourad Boudhar (Ann. Oper. Res., 2018)

Two-machine flowshop scheduling problem with coupled-operations. - Nadjat Meziani; Ammar Oulamara; Mourad Boudhar (Ann. Oper. Res., 2019)

Scheduling identical jobs on uniform machines with a conflict graph. - Amin Mallek; Mohamed Bendraouche; Mourad Boudhar (Comput. Oper. Res., 2019)

New results in two identical machines scheduling with agreement graphs. - Amine Mohabeddine; Mourad Boudhar (Theor. Comput. Sci., 2019)

Two-machine open shop problem with agreement graph. - Nour El Houda Tellache; Mourad Boudhar; Farouk Yalaoui (Theor. Comput. Sci., 2019)

Two-machine open shop problem with a single server and set-up time considerations. - Nadia Babou; Djamal Rebaine; Mourad Boudhar (Theor. Comput. Sci., 2021)

A two-machine no-wait flow shop problem with two competing agents. - Abdennour Azerine; Mourad Boudhar; Djamal Rebaine (J. Comb. Optim., 2022)

A cloud weather forecasting service and its relationship with anomaly detection. - Amina Khedimi; Tarek Menouer; Christophe Cérin; Mourad Boudhar (Serv. Oriented Comput. Appl., 2022)

Compatibility graphs in scheduling on batch processing machines. - Khaoula Bouakaz; Mourad Boudhar (CoRR, 2023)

Throughput optimisation in reentrant circular regular robot cells. - Ali Khebouche; Mourad Boudhar; El-sedik Lamini (Int. J. Math. Oper. Res., 2023)

Equitable colouring and scheduling on identical machines. - Sarah Nouri; Mourad Boudhar (Int. J. Math. Oper. Res., 2023)

Bi-criteria two-machine flow shop scheduling problem involving sequence-dependent setup times and pieces multiplicity. - Djedjiga Ouiddir; Mourad Boudhar; Karima Bouibede-Hocine (Int. J. Math. Oper. Res., 2023)

Reentrant open shop scheduling problem with time lags and no-wait constraints. - Kenza Alioui; Karim Amrouche; Mourad Boudhar (Comput. Oper. Res., 2024)

Two-machine job shop problem with a single server and sequence-independent non-anticipatory set-up times. - Nadia Babou; Mourad Boudhar; Djamal Rebaine (Discret. Optim., 2024)

Two-machine reentrant circular robotic cells with swap ability. - Ali Khebouche; Mourad Boudhar (Int. J. Comput. Sci. Math., 2024)

Scheduling on identical machines with preemption and setup times. - Amina Haned; Abida Kerdali; Mourad Boudhar (Int. J. Prod. Res., 2024)

On the complexity of proportionate open shop and job shop problems. - Abdennour Azerine; Mourad Boudhar; Djamal Rebaine (Optim. Lett., 2024)

Scheduling on uniform machines with a conflict graph: complexity and resolution. - Amin Mallek; Mourad Boudhar (Int. Trans. Oper. Res., 2024)

Solving the two-machine open shop problem with a single server with respect to the makespan. - Nadia Babou; Djamal Rebaine; Mourad Boudhar (Ann. Oper. Res., 2024)

New efficient algorithms for the two-machine no-wait chain-reentrant shop problem. - Nazim Sami; Karim Amrouche; Mourad Boudhar (J. Comb. Optim., 2024)

Scheduling on identical machines with conflicts to minimize the mean flow time. - Nour El Houda Tellache; Lydia Aoudia; Mourad Boudhar (CoRR, 2025)