Talel Ladhari

492 total citations
38 papers, 358 citations indexed

About

Talel Ladhari is a scholar working on Industrial and Manufacturing Engineering, Computer Networks and Communications and Management Science and Operations Research. According to data from OpenAlex, Talel Ladhari has authored 38 papers receiving a total of 358 indexed citations (citations by other indexed papers that have themselves been cited), including 32 papers in Industrial and Manufacturing Engineering, 17 papers in Computer Networks and Communications and 8 papers in Management Science and Operations Research. Recurrent topics in Talel Ladhari's work include Scheduling and Optimization Algorithms (29 papers), Advanced Manufacturing and Logistics Optimization (19 papers) and Optimization and Search Problems (16 papers). Talel Ladhari is often cited by papers focused on Scheduling and Optimization Algorithms (29 papers), Advanced Manufacturing and Logistics Optimization (19 papers) and Optimization and Search Problems (16 papers). Talel Ladhari collaborates with scholars based in Tunisia, Saudi Arabia and France. Talel Ladhari's co-authors include Mohamed Haouari, M. Zied Babaï, Anis Gharbi, M. Zied Babai, Ali Allahverdi, Vincent t'Kindt, Mahdi Jemmali, Mohamed Jemni, Saoussen Krichen and Hani Alquhayz and has published in prestigious journals such as European Journal of Operational Research, IEEE Access and International Journal of Production Economics.

In The Last Decade

Talel Ladhari

36 papers receiving 341 citations

Peers

Talel Ladhari
Peng-Jen Lai Taiwan
Susumu Fujii Japan
Ross J.W. James New Zealand
A.M.A. Hariri United Kingdom
Étienne Craye France
Chunrong Zuo China
Marie‐Claude Portmann France
D. Ramaswamy United States
Ömer Faruk Baykoç Türkiye
Adar Kalir United States
Peng-Jen Lai Taiwan
Talel Ladhari
Citations per year, relative to Talel Ladhari Talel Ladhari (= 1×) peers Peng-Jen Lai

Countries citing papers authored by Talel Ladhari

Since Specialization
Citations

This map shows the geographic impact of Talel Ladhari's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Talel Ladhari with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Talel Ladhari more than expected).

Fields of papers citing papers by Talel Ladhari

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Talel Ladhari. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Talel Ladhari. The network helps show where Talel Ladhari may publish in the future.

Co-authorship network of co-authors of Talel Ladhari

This figure shows the co-authorship network connecting the top 25 collaborators of Talel Ladhari. A scholar is included among the top collaborators of Talel Ladhari based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Talel Ladhari. Talel Ladhari is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Banjar, Ameen, et al.. (2023). Intelligent Scheduling Algorithms for the Enhancement of Drone-Based Innovative Logistic Supply Chain Systems. IEEE Access. 11. 102418–102429. 5 indexed citations
2.
Ladhari, Talel, et al.. (2023). Tight lower bounds for the Traveling Salesman Problem with draft limits. Computers & Operations Research. 154. 106196–106196. 1 indexed citations
3.
Aljohani, Abeer, et al.. (2022). Minimizing Total Tardiness in a Two-Machine Flowshop Scheduling Problem with Availability Constraints. Intelligent Automation & Soft Computing. 35(1). 1119–1134. 4 indexed citations
4.
Jemmali, Mahdi, et al.. (2021). Optimal algorithm for a two-machine flowshop scheduling problem with release dates and blocking constraints. Journal of the Chinese Institute of Engineers. 44(5). 440–447. 3 indexed citations
5.
Jemmali, Mahdi, et al.. (2021). Metaheuristic algorithms for the two-machine flowshop scheduling problem with release dates and blocking constraint. Journal of the Chinese Institute of Engineers. 44(6). 573–582. 6 indexed citations
6.
7.
Ladhari, Talel, et al.. (2018). Strong multi-commodity flow formulations for the asymmetric traveling salesman problem. European Journal of Operational Research. 271(1). 72–79. 7 indexed citations
8.
Ladhari, Talel, et al.. (2018). A Genetic Algorithm-Based Classification Approach for Multicriteria ABC Analysis. International Journal of Information Technology & Decision Making. 17(6). 1805–1837. 17 indexed citations
9.
Ladhari, Talel, et al.. (2017). Evolutionary multiobjective optimization for the multi-machine flow shop scheduling problem under blocking. Annals of Operations Research. 267(1-2). 413–430. 19 indexed citations
10.
Ladhari, Talel, et al.. (2016). An Efficient Iterated Greedy Algorithm for the Makespan Blocking Flow Shop Scheduling Problem. 53. 91–95. 3 indexed citations
11.
Ladhari, Talel, et al.. (2015). Minimizing Regular Objectives for Blocking Permutation Flow Shop Scheduling. 441–448. 3 indexed citations
12.
Ladhari, Talel, et al.. (2014). Genetic Algorithm to infer criteria weights for Multicriteria Inventory Classification. 276–281. 1 indexed citations
13.
14.
Gharbi, Anis, et al.. (2013). The two-machine flowshop scheduling problem with sequence-independent setup times: New lower bounding strategies. European Journal of Operational Research. 231(1). 69–78. 21 indexed citations
15.
Krichen, Saoussen, et al.. (2013). A discrete artificial bee colony algorithm for resource-constrained project scheduling problem. 1–6. 7 indexed citations
16.
17.
Jemni, Mohamed, et al.. (2010). Design of parallel distributed algorithm for the Permutation Flow Shop Problem. 65–72. 1 indexed citations
18.
Gharbi, Anis, et al.. (2010). Polynomial Lower Bounds for the Two-Machine Flowshop Problem with Sequence-Independent Setup Times. Electronic Notes in Discrete Mathematics. 36. 1089–1096. 4 indexed citations
19.
Ladhari, Talel, et al.. (2009). Heuristics and lower bounds for minimizing the total completion time in a two-machine flowshop. International Journal of Production Economics. 122(2). 678–691. 14 indexed citations
20.

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Peng-Jen Lai Breakdown of academic impact, for papers by Susumu Fujii Breakdown of academic impact, for papers by Ross J.W. James Breakdown of academic impact, for papers by A.M.A. Hariri Breakdown of academic impact, for papers by Étienne Craye Breakdown of academic impact, for papers by Chunrong Zuo Breakdown of academic impact, for papers by Marie‐Claude Portmann Breakdown of academic impact, for papers by D. Ramaswamy Breakdown of academic impact, for papers by Ömer Faruk Baykoç Breakdown of academic impact, for papers by Adar Kalir
Rankless by CCL
2026