Nour El Houda Tellache

11 papers Journal 11
YearRankTypeTitle / Venue / Authors
2025 J jnl
Aircraft routing: periodicity and complexity.
CoRR
Frédéric Meunier, Axel Parmentier, Nour El Houda Tellache
2025 J jnl
On a Variant of the Minimum Path Cover Problem in Acyclic Digraphs: Computational Complexity Results and Exact Method.
CoRR
Nour El Houda Tellache, Roberto Baldacci
2025 J jnl
On a Variant of the Minimum Path Cover Problem in Acyclic Digraphs: Computational Complexity Results and Exact Method.
Networks
Nour El Houda Tellache, Roberto Baldacci
2025 J jnl
Scheduling on identical machines with conflicts to minimize the mean flow time.
CoRR
Nour El Houda Tellache, Lydia Aoudia, Mourad Boudhar
2024 J jnl
Linear Lexicographic Optimization and Preferential Bidding System.
Transp. Sci.
Nour El Houda Tellache, Frédéric Meunier, Axel Parmentier
2023 J jnl
A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan.
Comput. Oper. Res.
Nour El Houda Tellache, Laoucine Kerbache
2021 J jnl
New complexity results for shop scheduling problems with agreement graphs.
Theor. Comput. Sci.
Nour El Houda Tellache
2019 J jnl
Two-machine open shop problem with agreement graph.
Theor. Comput. Sci.
Nour El Houda Tellache, Mourad Boudhar, Farouk Yalaoui
2018 J jnl
Flow shop scheduling problem with conflict graphs.
Ann. Oper. Res.
Nour El Houda Tellache, Mourad Boudhar
2017 J jnl
Open shop scheduling problems with conflict graphs.
Discret. Appl. Math.
Nour El Houda Tellache, Mourad Boudhar
2017 J jnl
Two-machine flow shop problem with unit-time operations and conflict graph.
Int. J. Prod. Res.
Nour El Houda Tellache, Mourad Boudhar