List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| On a variant of the minimum path cover problem in acyclic digraphs: computational complexity results and exact method Networks | 2025-12-05 | Paper |
| A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan Computers & Operations Research | 2023-07-04 | Paper |
| Linear lexicographic optimization and preferential bidding system | 2022-01-21 | Paper |
| New complexity results for shop scheduling problems with agreement graphs Theoretical Computer Science | 2021-10-06 | Paper |
| Two-machine open shop problem with agreement graph Theoretical Computer Science | 2019-11-13 | Paper |
| Flow shop scheduling problem with conflict graphs Annals of Operations Research | 2018-03-23 | Paper |
| Open shop scheduling problems with conflict graphs Discrete Applied Mathematics | 2017-06-19 | Paper |
Research outcomes over time
This page was built for person: Nour El Houda Tellache
