Assaf Sarig

450 total citations
22 papers, 358 citations indexed

About

Assaf Sarig is a scholar working on Industrial and Manufacturing Engineering, Computer Networks and Communications and Management Information Systems. According to data from OpenAlex, Assaf Sarig has authored 22 papers receiving a total of 358 indexed citations (citations by other indexed papers that have themselves been cited), including 22 papers in Industrial and Manufacturing Engineering, 17 papers in Computer Networks and Communications and 7 papers in Management Information Systems. Recurrent topics in Assaf Sarig's work include Scheduling and Optimization Algorithms (22 papers), Optimization and Search Problems (17 papers) and Advanced Manufacturing and Logistics Optimization (9 papers). Assaf Sarig is often cited by papers focused on Scheduling and Optimization Algorithms (22 papers), Optimization and Search Problems (17 papers) and Advanced Manufacturing and Logistics Optimization (9 papers). Assaf Sarig collaborates with scholars based in Israel, United Kingdom and Canada. Assaf Sarig's co-authors include Gur Mosheiov, Vitaly A. Strusevich, Asaf Levin, Jeffrey B. Sidney, Enrique Gerstl and Gur Mosheiov and has published in prestigious journals such as European Journal of Operational Research, Information Sciences and Journal of the Operational Research Society.

In The Last Decade

Assaf Sarig

20 papers receiving 343 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Assaf Sarig Israel 12 348 146 38 26 11 22 358
Tang Heng-yong China 12 480 1.4× 190 1.3× 37 1.0× 16 0.6× 4 0.4× 31 508
Ling‐Huey Su Taiwan 11 378 1.1× 101 0.7× 25 0.7× 32 1.2× 5 0.5× 31 405
Kabir Rustogi United Kingdom 9 316 0.9× 124 0.8× 29 0.8× 9 0.3× 12 1.1× 11 330
Surya Danusaputro Liman United States 9 382 1.1× 179 1.2× 59 1.6× 16 0.6× 9 0.8× 18 403
Andreas Klemmt Germany 10 329 0.9× 43 0.3× 22 0.6× 40 1.5× 6 0.5× 34 349
Daniel Oron Australia 18 697 2.0× 384 2.6× 78 2.1× 27 1.0× 5 0.5× 43 718
Xin-Na Geng China 11 342 1.0× 213 1.5× 23 0.6× 6 0.2× 8 0.7× 17 360
Joachim Breit Germany 8 317 0.9× 96 0.7× 16 0.4× 11 0.4× 11 1.0× 8 327
Xue Huang China 17 677 1.9× 342 2.3× 40 1.1× 11 0.4× 3 0.3× 34 687
Lingfa Lu China 14 604 1.7× 334 2.3× 73 1.9× 17 0.7× 2 0.2× 41 624

Countries citing papers authored by Assaf Sarig

Since Specialization
Citations

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

Fields of papers citing papers by Assaf Sarig

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Assaf Sarig

This figure shows the co-authorship network connecting the top 25 collaborators of Assaf Sarig. A scholar is included among the top collaborators of Assaf Sarig 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 Assaf Sarig. Assaf Sarig 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.
Mosheiov, Gur & Assaf Sarig. (2025). A note: approximation algorithms for batch scheduling on shops with job rejection. Operational Research. 25(2).
2.
Mosheiov, Gur & Assaf Sarig. (2024). The minmax due-date assignment problem with acceptable lead-times. Annals of Operations Research. 343(1). 401–410. 1 indexed citations
3.
Mosheiov, Gur & Assaf Sarig. (2024). A note: Minmax due-window assignment with fixed earliness-tardiness costs. Journal of Industrial and Management Optimization. 20(11). 3552–3561.
4.
Mosheiov, Gur & Assaf Sarig. (2023). A note on lot scheduling on a single machine to minimize maximum weighted tardiness. Journal of Combinatorial Optimization. 45(5). 2 indexed citations
5.
Mosheiov, Gur & Assaf Sarig. (2023). A common due-date assignment problem with job rejection on parallel uniform machines. International Journal of Production Research. 62(6). 2083–2092. 2 indexed citations
6.
Mosheiov, Gur, Assaf Sarig, & Vitaly A. Strusevich. (2019). Minmax scheduling and due-window assignment with position-dependent processing times and job rejection. 4OR. 18(4). 439–456. 11 indexed citations
7.
Gerstl, Enrique, Gur Mosheiov, & Assaf Sarig. (2014). Batch Scheduling In A Two-Stage Flexible Flow Shop Problem. Foundations of Computing and Decision Sciences. 39(1). 3–16. 11 indexed citations
8.
Mosheiov, Gur & Assaf Sarig. (2010). A note: a due-window assignment problem on parallel identical machines. Journal of the Operational Research Society. 62(1). 238–241. 9 indexed citations
9.
Mosheiov, Gur & Assaf Sarig. (2009). Scheduling and due-date assignment problems with job rejection. Foundations of Computing and Decision Sciences. 193–208. 3 indexed citations
10.
Mosheiov, Gur & Assaf Sarig. (2009). Scheduling a maintenance activity to minimize total weighted completion-time. Computers & Mathematics with Applications. 57(4). 619–623. 48 indexed citations
11.
Mosheiov, Gur & Assaf Sarig. (2009). Scheduling with a common due-window: Polynomially solvable cases. Information Sciences. 180(8). 1492–1505. 17 indexed citations
12.
Mosheiov, Gur & Assaf Sarig. (2009). Scheduling identical jobs and due-window on uniform machines. European Journal of Operational Research. 201(3). 712–719. 14 indexed citations
13.
Mosheiov, Gur & Assaf Sarig. (2009). Minimum weighted number of tardy jobs on an m-machine flow-shop with a critical machine. European Journal of Operational Research. 201(2). 404–408. 14 indexed citations
14.
Mosheiov, Gur & Assaf Sarig. (2008). A multi-criteria scheduling with due-window assignment problem. Mathematical and Computer Modelling. 48(5-6). 898–907. 5 indexed citations
15.
Mosheiov, Gur & Assaf Sarig. (2008). Minmax scheduling problems with a common due-window. Computers & Operations Research. 36(6). 1886–1892. 31 indexed citations
16.
Mosheiov, Gur & Assaf Sarig. (2008). A note: Simple heuristics for scheduling a maintenance activity on unrelated machines. Computers & Operations Research. 36(10). 2759–2762. 6 indexed citations
17.
Levin, Asaf, Gur Mosheiov, & Assaf Sarig. (2008). Scheduling a maintenance activity on parallel identical machines. Naval Research Logistics (NRL). 56(1). 33–41. 22 indexed citations
18.
Mosheiov, Gur & Assaf Sarig. (2008). Scheduling a maintenance activity and due-window assignment on a single machine. Computers & Operations Research. 36(9). 2541–2545. 65 indexed citations
19.
Mosheiov, Gur & Assaf Sarig. (2007). A due-window assignment problem with position-dependent processing times. Journal of the Operational Research Society. 59(7). 997–1003. 41 indexed citations
20.
Mosheiov, Gur & Assaf Sarig. (2007). Due-date assignment on uniform machines. European Journal of Operational Research. 193(1). 49–58. 16 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