Open shop scheduling problems with conflict graphs. - Nour El Houda Tellache; Mourad Boudhar (Discret. Appl. Math., 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 open shop problem with agreement graph. - Nour El Houda Tellache; Mourad Boudhar; Farouk Yalaoui (Theor. Comput. Sci., 2019)

New complexity results for shop scheduling problems with agreement graphs. - Nour El Houda Tellache (Theor. Comput. Sci., 2021)

A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan. - Nour El Houda Tellache; Laoucine Kerbache (Comput. Oper. Res., 2023)

Linear Lexicographic Optimization and Preferential Bidding System. - Nour El Houda Tellache; Frédéric Meunier; Axel Parmentier (Transp. Sci., 2024)

On a Variant of the Minimum Path Cover Problem in Acyclic Digraphs: Computational Complexity Results and Exact Method. - Nour El Houda Tellache; Roberto Baldacci (CoRR, 2025)

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

Aircraft routing: periodicity and complexity. - Frédéric Meunier; Axel Parmentier; Nour El Houda Tellache (CoRR, 2025)