Gur Mosheiov

4.9k total citations
142 papers, 3.8k citations indexed

About

Gur Mosheiov is a scholar working on Industrial and Manufacturing Engineering, Computer Networks and Communications and Management Information Systems. According to data from OpenAlex, Gur Mosheiov has authored 142 papers receiving a total of 3.8k indexed citations (citations by other indexed papers that have themselves been cited), including 140 papers in Industrial and Manufacturing Engineering, 104 papers in Computer Networks and Communications and 29 papers in Management Information Systems. Recurrent topics in Gur Mosheiov's work include Scheduling and Optimization Algorithms (136 papers), Optimization and Search Problems (102 papers) and Advanced Manufacturing and Logistics Optimization (62 papers). Gur Mosheiov is often cited by papers focused on Scheduling and Optimization Algorithms (136 papers), Optimization and Search Problems (102 papers) and Advanced Manufacturing and Logistics Optimization (62 papers). Gur Mosheiov collaborates with scholars based in Israel, Australia and United States. Gur Mosheiov's co-authors include Baruch Mor, Jeffrey B. Sidney, Assaf Sarig, Enrique Gerstl, Daniel Oron, Awi Federgruen, Dvir Shabtay, Shoshana Anily, Alessandro Agnetis and Dana Shapira and has published in prestigious journals such as SHILAP Revista de lepidopterología, Management Science and European Journal of Operational Research.

In The Last Decade

Gur Mosheiov

136 papers receiving 3.6k citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Gur Mosheiov Israel 33 3.7k 1.8k 425 116 113 142 3.8k
Christos Koulamas United States 21 2.0k 0.5× 726 0.4× 283 0.7× 137 1.2× 108 1.0× 118 2.2k
Vitaly A. Strusevich United Kingdom 29 2.6k 0.7× 977 0.5× 145 0.3× 66 0.6× 119 1.1× 118 2.7k
Spyros Reveliotis United States 25 1.5k 0.4× 381 0.2× 320 0.8× 56 0.5× 53 0.5× 144 2.6k
Bertrand M.T. Lin Taiwan 25 2.1k 0.6× 738 0.4× 146 0.3× 159 1.4× 161 1.4× 114 2.5k
Wen‐Chiung Lee Taiwan 35 2.7k 0.7× 1.3k 0.7× 203 0.5× 175 1.5× 121 1.1× 87 2.9k
Dvir Shabtay Israel 26 2.0k 0.5× 1.2k 0.6× 228 0.5× 65 0.6× 136 1.2× 88 2.1k
Imed Kacem France 19 1.8k 0.5× 541 0.3× 67 0.2× 418 3.6× 91 0.8× 102 2.1k
M. Seli̇m Aktürk Türkiye 27 1.5k 0.4× 219 0.1× 215 0.5× 71 0.6× 185 1.6× 75 1.8k
Rasaratnam Logendran United States 29 1.9k 0.5× 202 0.1× 182 0.4× 103 0.9× 144 1.3× 74 2.1k
J.A. Hoogeveen Netherlands 21 1.4k 0.4× 682 0.4× 82 0.2× 90 0.8× 66 0.6× 45 1.6k

Countries citing papers authored by Gur Mosheiov

Since Specialization
Citations

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

Fields of papers citing papers by Gur Mosheiov

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Gur Mosheiov

This figure shows the co-authorship network connecting the top 25 collaborators of Gur Mosheiov. A scholar is included among the top collaborators of Gur Mosheiov 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 Gur Mosheiov. Gur Mosheiov 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.
Mor, Baruch, Gur Mosheiov, & Dvir Shabtay. (2025). Scheduling problems on parallel machines with machine-dependent generalized due-dates. Annals of Operations Research. 347(3). 1455–1471.
2.
Gerstl, Enrique & Gur Mosheiov. (2024). Minimizing the number of tardy jobs with generalized due-dates and position-dependent processing times. Optimization Letters. 19(4). 833–845. 4 indexed citations
3.
Lin, Bertrand M.T., Shuwei Liu, & Gur Mosheiov. (2024). Scheduling with a weight-modifying activity to minimize the total weighted completion time. Omega. 128. 103115–103115.
4.
Mosheiov, Gur, et al.. (2024). Common due-date assignment problems with fixed-plus-linear earliness and tardiness costs. Computers & Industrial Engineering. 188. 109915–109915. 4 indexed citations
5.
Gerstl, Enrique & Gur Mosheiov. (2023). The LPT heuristic for minimizing total load on a proportionate openshop. Discrete Applied Mathematics. 338. 190–198.
6.
Gawiejnowicz, Stanisław, Bertrand M.T. Lin, & Gur Mosheiov. (2023). Dynamic scheduling problems in theory and practice. Journal of Scheduling. 27(3). 225–226.
7.
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
8.
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
9.
Shabtay, Dvir, Gur Mosheiov, & Daniel Oron. (2022). Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work. European Journal of Operational Research. 303(1). 66–77. 26 indexed citations
10.
Mor, Baruch, Gur Mosheiov, & Dvir Shabtay. (2021). Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates. Journal of Scheduling. 24(6). 553–567. 16 indexed citations
11.
Gerstl, Enrique & Gur Mosheiov. (2020). The single machine CON problem with unavailability period. International Journal of Production Research. 59(3). 824–838. 7 indexed citations
12.
Gerstl, Enrique & Gur Mosheiov. (2017). Minmax weighted earliness-tardiness with identical processing times and two competing agents. Computers & Industrial Engineering. 107. 171–177. 3 indexed citations
13.
Gerstl, Enrique, Baruch Mor, & Gur Mosheiov. (2016). Minmax scheduling with acceptable lead-times: Extensions to position-dependent processing times, due-window and job rejection. 39–41. 8 indexed citations
14.
Gerstl, Enrique, Baruch Mor, & Gur Mosheiov. (2016). Scheduling with two competing agents to minimize total weighted earliness. Annals of Operations Research. 253(1). 227–245. 2 indexed citations
15.
Gerstl, Enrique, Baruch Mor, & Gur Mosheiov. (2014). A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop. Information Processing Letters. 115(2). 159–162. 18 indexed citations
16.
Mor, Baruch & Gur Mosheiov. (2011). Minmax scheduling problems with common flow-allowance. Journal of the Operational Research Society. 63(9). 1284–1293. 15 indexed citations
17.
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
18.
Mosheiov, Gur & Daniel Oron. (2006). Due-date assignment and maintenance activity scheduling problem. Mathematical and Computer Modelling. 44(11-12). 1053–1057. 61 indexed citations
19.
Mosheiov, Gur. (2002). Complexity analysis of job-shop scheduling with deteriorating jobs. Discrete Applied Mathematics. 117(1-3). 195–209. 82 indexed citations
20.
Mosheiov, Gur. (1998). The solution of the soccer “dream league” game. Mathematical and Computer Modelling. 27(8). 79–83. 1 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