Ameur Soukhal

864 total citations
24 papers, 577 citations indexed

About

Ameur Soukhal is a scholar working on Industrial and Manufacturing Engineering, Computer Networks and Communications and Management Science and Operations Research. According to data from OpenAlex, Ameur Soukhal has authored 24 papers receiving a total of 577 indexed citations (citations by other indexed papers that have themselves been cited), including 22 papers in Industrial and Manufacturing Engineering, 11 papers in Computer Networks and Communications and 4 papers in Management Science and Operations Research. Recurrent topics in Ameur Soukhal's work include Scheduling and Optimization Algorithms (22 papers), Optimization and Search Problems (10 papers) and Advanced Manufacturing and Logistics Optimization (8 papers). Ameur Soukhal is often cited by papers focused on Scheduling and Optimization Algorithms (22 papers), Optimization and Search Problems (10 papers) and Advanced Manufacturing and Logistics Optimization (8 papers). Ameur Soukhal collaborates with scholars based in France, Belarus and Mauritania. Ameur Soukhal's co-authors include Dario Pacciarelli, Alessandro Agnetis, Stanisław Gawiejnowicz, Patrick Martineau, Jean‐Charles Billaut, Ammar Oulamara, Mikhail Y. Kovalyov, J.-C. Billaut, Sergey Kovalev and Alexandre Dolgui and has published in prestigious journals such as European Journal of Operational Research, Computers & Operations Research and Annals of Operations Research.

In The Last Decade

Ameur Soukhal

23 papers receiving 554 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Ameur Soukhal France 12 556 275 53 50 23 24 577
Lingfa Lu China 14 604 1.1× 334 1.2× 73 1.4× 17 0.3× 9 0.4× 41 624
Thomas Tautenhahn Germany 12 608 1.1× 355 1.3× 20 0.4× 30 0.6× 21 0.9× 20 640
Wen-Hung Kuo Taiwan 17 935 1.7× 474 1.7× 90 1.7× 39 0.8× 55 2.4× 31 964
Ling‐Huey Su Taiwan 11 378 0.7× 101 0.4× 25 0.5× 32 0.6× 23 1.0× 31 405
Wen-Hung Wu Taiwan 12 433 0.8× 204 0.7× 29 0.5× 18 0.4× 51 2.2× 20 451
Daniel Oron Australia 18 697 1.3× 384 1.4× 78 1.5× 27 0.5× 20 0.9× 43 718
Guoqing Wang China 12 912 1.6× 375 1.4× 73 1.4× 35 0.7× 41 1.8× 19 939
Talel Ladhari Tunisia 12 259 0.5× 79 0.3× 49 0.9× 80 1.6× 32 1.4× 38 358
Jeffrey Schaller United States 17 688 1.2× 144 0.5× 51 1.0× 10 0.2× 46 2.0× 32 698
Stanisław Zdrzałka Poland 9 437 0.8× 201 0.7× 28 0.5× 21 0.4× 14 0.6× 13 452

Countries citing papers authored by Ameur Soukhal

Since Specialization
Citations

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

Fields of papers citing papers by Ameur Soukhal

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Ameur Soukhal

This figure shows the co-authorship network connecting the top 25 collaborators of Ameur Soukhal. A scholar is included among the top collaborators of Ameur Soukhal 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 Ameur Soukhal. Ameur Soukhal 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.
Rault, Tifenn, et al.. (2024). Scheduling two interfering job sets on identical parallel machines with makespan and total completion time minimization. Journal of Scheduling. 27(5). 485–505. 2 indexed citations
2.
Emmanuel, N. Okwor Anthony A. Adeyeye, et al.. (2022). Multi-project scheduling problem under shared multi-skill resource constraints. Top. 31(1). 194–235. 7 indexed citations
3.
Emmanuel, N. Okwor Anthony A. Adeyeye, et al.. (2022). A Hybrid Heuristic for a Two-Agent Multi-Skill Resource-Constrained Scheduling Problem. International Journal of Advanced Computer Science and Applications. 13(5). 2 indexed citations
4.
Emmanuel, N. Okwor Anthony A. Adeyeye, et al.. (2021). Improved approaches to solve the One-To-One SkewGraM problem. Computers & Operations Research. 138. 105584–105584.
5.
Tran, Lang, et al.. (2020). Resolution for bounded-splitting jobs scheduling problem on a single machine in available time-windows. Journal of Ambient Intelligence and Humanized Computing. 12(1). 1179–1196. 1 indexed citations
6.
Yugma, Claude, et al.. (2020). An Agent-Based Simulation Model with Human Resource Integration for Semiconductor Manufacturing Facility. 20. 1801–1812. 1 indexed citations
7.
Soukhal, Ameur, et al.. (2017). Complexity analyses for multi-agent scheduling problems with a global agent and equal length jobs. Discrete Optimization. 23. 93–104. 8 indexed citations
8.
Dolgui, Alexandre, et al.. (2017). Optimal workforce assignment to operations of a paced assembly line. European Journal of Operational Research. 264(1). 200–211. 39 indexed citations
9.
Soukhal, Ameur, et al.. (2016). A bi-objective algorithm for a reactive multi-skill project scheduling problem. INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY. 15(11). 7202–7212. 1 indexed citations
10.
Dolgui, Alexandre, et al.. (2015). Minimizing the number of workers for one cycle of a paced production line. IFAC-PapersOnLine. 48(3). 2281–2286. 3 indexed citations
11.
Agnetis, Alessandro, Jean‐Charles Billaut, Stanisław Gawiejnowicz, Dario Pacciarelli, & Ameur Soukhal. (2014). Multiagent Scheduling: Models and Algorithms. CERN Document Server (European Organization for Nuclear Research). 114 indexed citations
12.
Soukhal, Ameur, et al.. (2014). Solving multi-agent scheduling problems on parallel machines with a global objective function. RAIRO - Operations Research. 48(2). 255–269. 6 indexed citations
13.
Agnetis, Alessandro, et al.. (2014). Multiagent Scheduling. Use Siena air (University of Siena). 134 indexed citations
14.
Liedloff, Mathieu, et al.. (2013). On an extension of the Sort & Search method with application to scheduling theory. Theoretical Computer Science. 511. 13–22. 12 indexed citations
15.
Soukhal, Ameur, et al.. (2011). Single-machine multi-agent scheduling problems with a global objective function. Journal of Scheduling. 15(3). 311–321. 27 indexed citations
16.
Soukhal, Ameur, et al.. (2011). Scheduling on parallel machines with preemption and transportation delays. Computers & Operations Research. 39(2). 374–381. 12 indexed citations
17.
Soukhal, Ameur, et al.. (2009). A new dynamic programming formulation for scheduling independent tasks with common due date on parallel machines. European Journal of Operational Research. 202(3). 646–653. 12 indexed citations
18.
Yuan, Jinjiang, et al.. (2006). A note on the complexity of flow shop scheduling with transportation constraints. European Journal of Operational Research. 178(3). 918–925. 23 indexed citations
19.
Soukhal, Ameur, Ammar Oulamara, & Patrick Martineau. (2003). Complexity of flow shop scheduling problems with transportation constraints. European Journal of Operational Research. 161(1). 32–41. 81 indexed citations
20.
Soukhal, Ameur & Patrick Martineau. (2003). Resolution of a scheduling problem in a flowshop robotic cell. European Journal of Operational Research. 161(1). 62–72. 24 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

Breakdown of academic impact, for papers by Lingfa Lu Breakdown of academic impact, for papers by Thomas Tautenhahn Breakdown of academic impact, for papers by Wen-Hung Kuo Breakdown of academic impact, for papers by Ling‐Huey Su Breakdown of academic impact, for papers by Wen-Hung Wu Breakdown of academic impact, for papers by Daniel Oron Breakdown of academic impact, for papers by Guoqing Wang Breakdown of academic impact, for papers by Talel Ladhari Breakdown of academic impact, for papers by Jeffrey Schaller Breakdown of academic impact, for papers by Stanisław Zdrzałka
Rankless by CCL
2026