I. Adiri

906 total citations
25 papers, 693 citations indexed

About

I. Adiri is a scholar working on Computer Networks and Communications, Industrial and Manufacturing Engineering and Management Information Systems. According to data from OpenAlex, I. Adiri has authored 25 papers receiving a total of 693 indexed citations (citations by other indexed papers that have themselves been cited), including 13 papers in Computer Networks and Communications, 13 papers in Industrial and Manufacturing Engineering and 10 papers in Management Information Systems. Recurrent topics in I. Adiri's work include Scheduling and Optimization Algorithms (13 papers), Advanced Manufacturing and Logistics Optimization (9 papers) and Advanced Queuing Theory Analysis (9 papers). I. Adiri is often cited by papers focused on Scheduling and Optimization Algorithms (13 papers), Advanced Manufacturing and Logistics Optimization (9 papers) and Advanced Queuing Theory Analysis (9 papers). I. Adiri collaborates with scholars based in Israel, United States and Netherlands. I. Adiri's co-authors include Esther Frostig, A. H. G. Rinnooy Kan, John Bruno, Uri Yechiali, Benjamin Avi-Itzhak, Vsevolod F. Lev, Micha Hofri, M. Yadin and Zvi Rosberg and has published in prestigious journals such as Management Science, European Journal of Operational Research and Operations Research.

In The Last Decade

I. Adiri

25 papers receiving 639 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
I. Adiri Israel 13 491 268 193 70 45 25 693
A.M.A. Hariri United Kingdom 13 572 1.2× 207 0.8× 120 0.6× 54 0.8× 34 0.8× 16 690
Natalia V. Shakhlevich United Kingdom 17 670 1.4× 295 1.1× 47 0.2× 60 0.9× 17 0.4× 52 769
B.J. Lageweg Netherlands 11 787 1.6× 417 1.6× 106 0.5× 73 1.0× 17 0.4× 14 912
Hirotaka Sakasegawa Japan 10 143 0.3× 74 0.3× 282 1.5× 95 1.4× 65 1.4× 18 388
Irfan M. Ovacik United States 10 597 1.2× 159 0.6× 74 0.4× 36 0.5× 22 0.5× 15 639
Han Hoogeveen Netherlands 14 1.0k 2.1× 569 2.1× 83 0.4× 58 0.8× 22 0.5× 33 1.1k
D.J. Hoitomt United States 7 538 1.1× 169 0.6× 54 0.3× 46 0.7× 37 0.8× 15 622
Edward A. MacNair United States 13 100 0.2× 247 0.9× 187 1.0× 186 2.7× 42 0.9× 34 494
Andrew W. Shogan United States 9 178 0.4× 55 0.2× 68 0.4× 85 1.2× 29 0.6× 10 348
Alexandre Brandwajn France 10 51 0.1× 207 0.8× 250 1.3× 81 1.2× 72 1.6× 42 396

Countries citing papers authored by I. Adiri

Since Specialization
Citations

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

Fields of papers citing papers by I. Adiri

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of I. Adiri

This figure shows the co-authorship network connecting the top 25 collaborators of I. Adiri. A scholar is included among the top collaborators of I. Adiri 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 I. Adiri. I. Adiri 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.
Adiri, I., Esther Frostig, & A. H. G. Rinnooy Kan. (1991). Scheduling on a single machine with a single breakdown to minimize stochastically the number of tardy jobs. Naval Research Logistics (NRL). 38(2). 261–271. 40 indexed citations
2.
Adiri, I., et al.. (1989). Open-shop scheduling problems with dominated machines. Naval Research Logistics (NRL). 36(3). 273–281. 29 indexed citations
3.
Adiri, I. & Esther Frostig. (1988). Exponentially distributed jobshop scheduling problems.. Communications in Statistics Stochastic Models. 4(1). 133–149. 1 indexed citations
4.
Adiri, I., et al.. (1987). Scheduling on machines with variable service rates. Computers & Operations Research. 14(4). 289–297. 12 indexed citations
5.
Adiri, I., et al.. (1984). Openshop and flowshop scheduling to minimize sum of completion times. Computers & Operations Research. 11(3). 275–284. 33 indexed citations
6.
Lev, Vsevolod F. & I. Adiri. (1984). V-shop scheduling. European Journal of Operational Research. 18(1). 51–56. 20 indexed citations
7.
Adiri, I., et al.. (1984). Mixing of non-preemptive and preemptive repeat priority disciplines. European Journal of Operational Research. 18(1). 86–97. 9 indexed citations
8.
Adiri, I. & Esther Frostig. (1984). A stochastic permutation-flowshop scheduling problem minimizing in distribution the schedule length. Operations Research Letters. 3(2). 101–103. 2 indexed citations
9.
Adiri, I., et al.. (1983). Route-Dependent Open-Shop Scheduling. IIE Transactions. 15(3). 231–234. 11 indexed citations
10.
Adiri, I., et al.. (1982). A Single Server Queueing System Working under Mixed Priority Disciplines. Operations Research. 30(1). 97–115. 18 indexed citations
11.
Adiri, I., et al.. (1982). Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times. Naval Research Logistics Quarterly. 29(3). 495–504. 113 indexed citations
12.
Adiri, I., et al.. (1982). An Efficient Optimal Algorithm for the Two-Machines Unit-Time Jobshop Schedule-Length Problem. Mathematics of Operations Research. 7(3). 354–360. 38 indexed citations
13.
Adiri, I., et al.. (1982). A note on the influence of missing operations on scheduling problems. Naval Research Logistics Quarterly. 29(3). 535–539. 14 indexed citations
14.
Adiri, I., et al.. (1979). A Dynamic Priority Queue with General Concave Priority Functions. Operations Research. 27(6). 1088–1100. 33 indexed citations
15.
Rosberg, Zvi & I. Adiri. (1976). Multilevel Queues with Extremal Priorities. Journal of the ACM. 23(4). 680–690. 1 indexed citations
16.
Adiri, I., Micha Hofri, & M. Yadin. (1973). A Multiprogramming Queue. Journal of the ACM. 20(4). 589–603. 5 indexed citations
17.
Adiri, I.. (1971). A Dynamic Time-Sharing Priority Queue. Journal of the ACM. 18(4). 603–610. 9 indexed citations
18.
Adiri, I. & Benjamin Avi-Itzhak. (1969). A Time-Sharing Queue with a Finite Number of Customers. Journal of the ACM. 16(2). 315–323. 26 indexed citations
19.
Adiri, I. & Benjamin Avi-Itzhak. (1969). A Time-Sharing Queue. Management Science. 15(11). 639–657. 17 indexed citations
20.
Adiri, I. & Benjamin Avi-Itzhak. (1969). A Time-Sharing Model with Many Queues. Operations Research. 17(6). 1077–1089. 11 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