Mansour Eddaly

542 total citations
24 papers, 421 citations indexed

About

Mansour Eddaly is a scholar working on Industrial and Manufacturing Engineering, Control and Systems Engineering and Management Information Systems. According to data from OpenAlex, Mansour Eddaly has authored 24 papers receiving a total of 421 indexed citations (citations by other indexed papers that have themselves been cited), including 21 papers in Industrial and Manufacturing Engineering, 4 papers in Control and Systems Engineering and 3 papers in Management Information Systems. Recurrent topics in Mansour Eddaly's work include Scheduling and Optimization Algorithms (19 papers), Advanced Manufacturing and Logistics Optimization (16 papers) and Assembly Line Balancing Optimization (10 papers). Mansour Eddaly is often cited by papers focused on Scheduling and Optimization Algorithms (19 papers), Advanced Manufacturing and Logistics Optimization (16 papers) and Assembly Line Balancing Optimization (10 papers). Mansour Eddaly collaborates with scholars based in Tunisia, Saudi Arabia and United Arab Emirates. Mansour Eddaly's co-authors include Bassem Jarboui, Patrick Siarry, Abdelwaheb Rebaï, Habib Chabchoub, Nejah Ben Mabrouk, Malek Masmoudi and Nenad Mladenović and has published in prestigious journals such as Computers & Operations Research, The International Journal of Advanced Manufacturing Technology and Journal of Intelligent Manufacturing.

In The Last Decade

Mansour Eddaly

24 papers receiving 411 citations

Author Peers

Peers are selected by citation overlap in the author's most active subfields. citations · hero ref

Author Last Decade Papers Cites
Mansour Eddaly 308 86 60 50 38 24 421
Andrei Soeanu 117 0.4× 67 0.8× 42 0.7× 27 0.5× 57 1.5× 22 311
Daniel Schütz 411 1.3× 84 1.0× 30 0.5× 34 0.7× 50 1.3× 51 569
Somayeh Malakuti 380 1.2× 82 1.0× 117 1.9× 31 0.6× 19 0.5× 34 542
Armand Toguyéni 152 0.5× 37 0.4× 69 1.1× 30 0.6× 36 0.9× 64 427
Andrew W. Shogan 178 0.6× 29 0.3× 55 0.9× 60 1.2× 18 0.5× 10 348
Yassine Qamsane 304 1.0× 29 0.3× 37 0.6× 51 1.0× 6 0.2× 17 411
Mario Gleirscher 48 0.2× 84 1.0× 27 0.5× 52 1.0× 93 2.4× 30 230
Mike Barth 214 0.7× 37 0.4× 11 0.2× 19 0.4× 23 0.6× 43 297
Éric Zamaï 59 0.2× 32 0.4× 30 0.5× 37 0.7× 13 0.3× 39 239
Étienne Craye 152 0.5× 28 0.3× 21 0.3× 22 0.4× 13 0.3× 50 283

Countries citing papers authored by Mansour Eddaly

Since Specialization
Citations

This map shows the geographic impact of Mansour Eddaly'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 Mansour Eddaly with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Mansour Eddaly more than expected).

Fields of papers citing papers by Mansour Eddaly

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Mansour Eddaly. 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 Mansour Eddaly. The network helps show where Mansour Eddaly may publish in the future.

Co-authorship network of co-authors of Mansour Eddaly

This figure shows the co-authorship network connecting the top 25 collaborators of Mansour Eddaly. A scholar is included among the top collaborators of Mansour Eddaly 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 Mansour Eddaly. Mansour Eddaly 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.
Jarboui, Bassem, Malek Masmoudi, & Mansour Eddaly. (2024). Epsilon Oscillation Algorithm for the bi-objective green identical parallel machine scheduling problem. Computers & Operations Research. 170. 106754–106754. 1 indexed citations
2.
Jarboui, Bassem & Mansour Eddaly. (2024). A branch-and-bound approach to the no-idle flowshop scheduling problem. Discrete Applied Mathematics. 347. 297–310. 1 indexed citations
3.
Eddaly, Mansour, Bassem Jarboui, & Patrick Siarry. (2023). Metaheuristics for Machine Learning. SPIRE - Sciences Po Institutional REpository. 4 indexed citations
4.
Mabrouk, Nejah Ben, et al.. (2020). Success factors of lean six sigma implementation in manufacturing. Uncertain Supply Chain Management. 205–216. 8 indexed citations
5.
Eddaly, Mansour, et al.. (2019). Variable neighborhood search algorithms for the permutation flowshop scheduling problem with the preventive maintenance. Operational Research. 21(4). 2525–2542. 16 indexed citations
6.
Jarboui, Bassem, et al.. (2017). Variable neighborhood formulation search approach for the multi-item capacitated lot-sizing problem with time windows and setup times. Yugoslav journal of operations research. 27(3). 301–322. 2 indexed citations
7.
Jarboui, Bassem, et al.. (2017). Branch and bound algorithm for solving blocking flowshop scheduling problem with total tardiness and total weighted tardiness criteria. International Journal of Operational Research. 30(4). 441–441. 4 indexed citations
8.
Rebaï, Abdelwaheb, et al.. (2017). Branch and bound algorithm for solving blocking flowshop scheduling problem with total tardiness and total weighted tardiness criteria. International Journal of Operational Research. 30(4). 441–441. 2 indexed citations
9.
Jarboui, Bassem, et al.. (2017). A variable neighborhood search algorithm for the capacitated vehicle routing problem. Electronic Notes in Discrete Mathematics. 58. 231–238. 31 indexed citations
10.
Eddaly, Mansour, Bassem Jarboui, & Patrick Siarry. (2016). Combinatorial particle swarm optimization for solving blocking flowshop scheduling problem. Journal of Computational Design and Engineering. 3(4). 295–311. 52 indexed citations
11.
Eddaly, Mansour, et al.. (2016). Branch-and-bound algorithm for solving blocking flowshop scheduling problems with makespan criterion. International Journal of Mathematics in Operational Research. 10(1). 34–34. 8 indexed citations
13.
Jarboui, Bassem, et al.. (2013). Solving blocking flowshop scheduling problem with branch and bound algorithm. 411–416. 3 indexed citations
14.
15.
Jarboui, Bassem, Mansour Eddaly, & Patrick Siarry. (2010). A hybrid genetic algorithm for solving no-wait flowshop scheduling problems. The International Journal of Advanced Manufacturing Technology. 54(9-12). 1129–1143. 38 indexed citations
16.
Jarboui, Bassem, et al.. (2010). A Hybrid Particle Swarm Optimization Algorithm for the Redundancy Allocation Problem. Journal of Computational Science. 1(3). 159–167. 57 indexed citations
17.
Eddaly, Mansour, et al.. (2010). Hierarchical production planning with flexibility in agroalimentary environment: a case study. Journal of Intelligent Manufacturing. 23(3). 811–819. 4 indexed citations
18.
Jarboui, Bassem, et al.. (2010). A branch and bound enhanced genetic algorithm for scheduling a flowline manufacturing cell with sequence dependent family setup times. Computers & Operations Research. 38(1). 387–393. 25 indexed citations
20.
Jarboui, Bassem, Mansour Eddaly, & Patrick Siarry. (2008). An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems. Computers & Operations Research. 36(9). 2638–2646. 137 indexed citations

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

Rankless by CCL
2026