Get started
Author

Nour ElHouda Tellache

Observed names: Nour Elhouda Tellache, Nour El Houda Tellache, Tellache, Nour ElHouda, Tellache, Nour Elhouda
Observed institutions: Sonatrach (Algeria), École nationale des ponts et chaussées, University of Fribourg, University of Sciences and Technology Houari Boumediene, CERMICS, Hamad bin Khalifa University, Qatar Foundation
ORCID: 0000-0002-2731-0514
Observed ORCID: 0000-0002-2731-0514
OpenAlex ID: A5046679342
Flow shop scheduling problem with conflict graphs
2017 · Nour El Houda Tellache, Mourad Boudhar · Annals of Operations Research · 27
Open shop scheduling problems with conflict graphs
2017 · Nour El Houda Tellache, Mourad Boudhar · Discrete Applied Mathematics · 22
PDF
Two-machine flow shop problem with unit-time operations and conflict graph
2016 · Nour El Houda Tellache, Mourad Boudhar · International Journal of Production Research · 15
A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan
2023 · Nour ElHouda Tellache, Laoucine Kerbache · Computers & Operations Research · 10
Two-machine open shop problem with agreement graph
2019 · Nour El Houda Tellache, Mourad Boudhar, et al. · Theoretical Computer Science · 7
PDF
Linear Lexicographic Optimization and Preferential Bidding System
2024 · Nour ElHouda Tellache, Frédéric Meunier, et al. · Transportation Science · 6
PDF
The two-machine flow shop problem with conflict graphs
2016 · Nour El Houda Tellache, Mourad Boudhar · IFAC-PapersOnLine · 6
A column-generation approach for an electricity technician routing and scheduling problem with a lexicographic objective
2026 · Elise Bangerter, David Schindl, et al. · SSRN Electronic Journal · 2
Improved Multiphase Flow Rate Models for Chokes in the Algerian HMD Oil Field
2020 · Nour ElHouda Tellache, Meriem Waffa Hassen, et al. · Arabian Journal for Science and Engineering · 2
Scheduling on identical machines with conflicts to minimize the mean flow time
2025 · Tellache, Nour ElHouda, Aoudia, Lydia, et al. · arXiv (Cornell University) · 1
PDF
New complexity results for shop scheduling problems with agreement graphs
2021 · Nour ElHouda Tellache · Theoretical Computer Science · 1
Minimizing the makespan in job shop scheduling under conflict graph constraints
2026 · Tellache, Nour Elhouda, Azerine, Abdenour · arXiv (Cornell University)
PDF
On a Variant of the Minimum Path Cover Problem in Acyclic Digraphs: Computational Complexity Results and Exact Method
2025 · Nour ElHouda Tellache, Roberto Baldacci · Networks
Works count: 14
Citation count: 100
H-index: 6
I10-index: 4
Year
Topic
Type