Nour El Houda Tellache

According to our database, Nour El Houda Tellache authored at least 11 papers between 2017 and 2026.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2026

A column-generation approach for an electricity technician routing and scheduling problem with a lexicographic objective.

Elise Bangerter, David Schindl, Meritxell Pacheco Paneque, Nour El Houda Tellache, Rodolphe Griset

CoRR, April, 2026

2025

Aircraft routing: periodicity and complexity.

Frédéric Meunier, Axel Parmentier, Nour El Houda Tellache

CoRR, August, 2025

Scheduling on identical machines with conflicts to minimize the mean flow time.

Nour El Houda Tellache, Lydia Aoudia, Mourad Boudhar

CoRR, July, 2025

On a Variant of the Minimum Path Cover Problem in Acyclic Digraphs: Computational Complexity Results and Exact Method.

Nour El Houda Tellache, Roberto Baldacci

Networks, 2025

2024

Linear Lexicographic Optimization and Preferential Bidding System.

Nour El Houda Tellache, Frédéric Meunier, Axel Parmentier

Transp. Sci., 2024

2023

A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan.

Nour El Houda Tellache, Laoucine Kerbache

Comput. Oper. Res., August, 2023

2021

New complexity results for shop scheduling problems with agreement graphs.

Nour El Houda Tellache

Theor. Comput. Sci., 2021

2019

Two-machine open shop problem with agreement graph.

Nour El Houda Tellache, Mourad Boudhar, Farouk Yalaoui

Theor. Comput. Sci., 2019

2018

Flow shop scheduling problem with conflict graphs.

Nour El Houda Tellache, Mourad Boudhar

Ann. Oper. Res., 2018

2017

Two-machine flow shop problem with unit-time operations and conflict graph.

Nour El Houda Tellache, Mourad Boudhar

Int. J. Prod. Res., 2017

Open shop scheduling problems with conflict graphs.

Nour El Houda Tellache, Mourad Boudhar

Discret. Appl. Math., 2017