A.M.A. Hariri

861 total citations
16 papers, 690 citations indexed

About

A.M.A. Hariri is a scholar working on Industrial and Manufacturing Engineering, Computer Networks and Communications and Management Information Systems. According to data from OpenAlex, A.M.A. Hariri has authored 16 papers receiving a total of 690 indexed citations (citations by other indexed papers that have themselves been cited), including 12 papers in Industrial and Manufacturing Engineering, 4 papers in Computer Networks and Communications and 4 papers in Management Information Systems. Recurrent topics in A.M.A. Hariri's work include Scheduling and Optimization Algorithms (12 papers), Advanced Manufacturing and Logistics Optimization (8 papers) and Assembly Line Balancing Optimization (7 papers). A.M.A. Hariri is often cited by papers focused on Scheduling and Optimization Algorithms (12 papers), Advanced Manufacturing and Logistics Optimization (8 papers) and Assembly Line Balancing Optimization (7 papers). A.M.A. Hariri collaborates with scholars based in United Kingdom, Saudi Arabia and United States. A.M.A. Hariri's co-authors include Chris N. Potts, Jatinder N.D. Gupta, Luk N. Van Wassenhove and S.K. Goyal and has published in prestigious journals such as Management Science, European Journal of Operational Research and Journal of the Operational Research Society.

In The Last Decade

A.M.A. Hariri

16 papers receiving 633 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
A.M.A. Hariri United Kingdom 13 572 207 120 54 39 16 690
I. Adiri Israel 13 491 0.9× 268 1.3× 193 1.6× 70 1.3× 16 0.4× 25 693
Michel Gourgand France 12 450 0.8× 58 0.3× 55 0.5× 51 0.9× 45 1.2× 46 530
Peng-Jen Lai Taiwan 12 422 0.7× 162 0.8× 74 0.6× 36 0.7× 57 1.5× 23 498
Michele E. Pfund United States 16 824 1.4× 207 1.0× 86 0.7× 49 0.9× 85 2.2× 32 904
Radosław Rudek Poland 17 699 1.2× 386 1.9× 44 0.4× 34 0.6× 63 1.6× 48 777
Irfan M. Ovacik United States 10 597 1.0× 159 0.8× 74 0.6× 36 0.7× 41 1.1× 15 639
Inés González-Rodríguez Spain 15 476 0.8× 74 0.4× 31 0.3× 48 0.9× 80 2.1× 30 556
Chou-Jung Hsu Taiwan 19 955 1.7× 286 1.4× 90 0.8× 25 0.5× 49 1.3× 43 986
Nir Halman Israel 9 129 0.2× 98 0.5× 77 0.6× 80 1.5× 16 0.4× 35 290
Stanisław Gawiejnowicz Poland 18 1.2k 2.1× 657 3.2× 88 0.7× 67 1.2× 24 0.6× 35 1.2k

Countries citing papers authored by A.M.A. Hariri

Since Specialization
Citations

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

Fields of papers citing papers by A.M.A. Hariri

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of A.M.A. Hariri

This figure shows the co-authorship network connecting the top 25 collaborators of A.M.A. Hariri. A scholar is included among the top collaborators of A.M.A. Hariri 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 A.M.A. Hariri. A.M.A. Hariri is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

16 of 16 papers shown
1.
Gupta, Jatinder N.D., A.M.A. Hariri, & Chris N. Potts. (1999). Single‐machine scheduling to minimize maximumtardiness with minimum number of tardy jobs. Annals of Operations Research. 92(0). 107–123. 5 indexed citations
2.
Hariri, A.M.A., et al.. (1998). Branch and bound algorithms for single-machinescheduling with batch set-up times to minimizetotal weighted completion time. Annals of Operations Research. 83(0). 59–76. 19 indexed citations
3.
Gupta, Jatinder N.D. & A.M.A. Hariri. (1997). Two-machine flowshop scheduling to minimize the number of tardy jobs. Journal of the Operational Research Society. 48(2). 212–220. 16 indexed citations
4.
Gupta, Jatinder N.D., A.M.A. Hariri, & Chris N. Potts. (1997). Scheduling a two-stage hybrid flow shop with parallel machines at the first stage. Annals of Operations Research. 69(0). 171–191. 97 indexed citations
5.
Hariri, A.M.A., et al.. (1997). Multi-item production lot-size inventory model with varying order cost under a restriction: A geometric programming approach. Production Planning & Control. 8(2). 179–182. 28 indexed citations
6.
Hariri, A.M.A. & Chris N. Potts. (1997). Single machine scheduling with batch set-up times to minimize maximum lateness. Annals of Operations Research. 70(0). 75–92. 35 indexed citations
7.
Hariri, A.M.A. & Chris N. Potts. (1997). A branch and bound algorithm for the two-stage assembly scheduling problem. European Journal of Operational Research. 103(3). 547–556. 109 indexed citations
8.
Hariri, A.M.A., et al.. (1995). Point Estimation and Confidence Intervals of the M/M/2/N Queue with Balking and Heterogeneity. American Journal of Mathematical and Management Sciences. 15(1-2). 35–55. 15 indexed citations
9.
Hariri, A.M.A., et al.. (1995). The resource constrained multi-item inventory problem with price discount: a geometric programming approach. Production Planning & Control. 6(4). 374–377. 4 indexed citations
10.
Hariri, A.M.A., Chris N. Potts, & Luk N. Van Wassenhove. (1995). Single Machine Scheduling to Minimize Total Weighted Late Work. INFORMS Journal on Computing. 7(2). 232–242. 58 indexed citations
11.
Hariri, A.M.A. & Chris N. Potts. (1994). Single Machine Scheduling with Deadlines to Minimize the Weighted Number of Tardy Jobs. Management Science. 40(12). 1712–1719. 24 indexed citations
12.
Hariri, A.M.A., et al.. (1992). The M/M/c/N queue with balking and reneging. Computers & Operations Research. 19(8). 713–716. 59 indexed citations
13.
Hariri, A.M.A. & Chris N. Potts. (1991). Heuristics for scheduling unrelated parallel machines. Computers & Operations Research. 18(3). 323–331. 64 indexed citations
14.
Hariri, A.M.A. & Chris N. Potts. (1989). A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop. European Journal of Operational Research. 38(2). 228–237. 40 indexed citations
15.
Hariri, A.M.A. & Chris N. Potts. (1984). Algorithms for two-machine flow-shop sequencing with precedence constraints. European Journal of Operational Research. 17(2). 238–248. 9 indexed citations
16.
Hariri, A.M.A. & Chris N. Potts. (1983). An algorithm for single machine sequencing with release dates to minimize total weighted completion time. Discrete Applied Mathematics. 5(1). 99–109. 108 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