Baruch Mor

1.3k total citations
63 papers, 847 citations indexed

About

Baruch Mor is a scholar working on Industrial and Manufacturing Engineering, Computer Networks and Communications and Management Information Systems. According to data from OpenAlex, Baruch Mor has authored 63 papers receiving a total of 847 indexed citations (citations by other indexed papers that have themselves been cited), including 61 papers in Industrial and Manufacturing Engineering, 45 papers in Computer Networks and Communications and 12 papers in Management Information Systems. Recurrent topics in Baruch Mor's work include Scheduling and Optimization Algorithms (61 papers), Optimization and Search Problems (42 papers) and Advanced Manufacturing and Logistics Optimization (35 papers). Baruch Mor is often cited by papers focused on Scheduling and Optimization Algorithms (61 papers), Optimization and Search Problems (42 papers) and Advanced Manufacturing and Logistics Optimization (35 papers). Baruch Mor collaborates with scholars based in Israel, United States and China. Baruch Mor's co-authors include Gur Mosheiov, Gur Mosheiov, Dana Shapira, Dvir Shabtay, Enrique Gerstl, Liron Yedidsion, Xin-Na Geng, Xinyu Sun, Daniel Oron and Jiayin Wang and has published in prestigious journals such as European Journal of Operational Research, International Journal of Production Economics and Journal of the Operational Research Society.

In The Last Decade

Baruch Mor

60 papers receiving 805 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Baruch Mor Israel 17 825 481 140 24 23 63 847
Daniel Oron Australia 18 697 0.8× 384 0.8× 78 0.6× 20 0.8× 22 1.0× 43 718
Guoqing Wang China 12 912 1.1× 375 0.8× 73 0.5× 41 1.7× 34 1.5× 19 939
Stanisław Gawiejnowicz Poland 18 1.2k 1.5× 657 1.4× 88 0.6× 25 1.0× 24 1.0× 35 1.2k
Lingfa Lu China 14 604 0.7× 334 0.7× 73 0.5× 9 0.4× 29 1.3× 41 624
Ameur Soukhal France 12 556 0.7× 275 0.6× 53 0.4× 23 1.0× 21 0.9× 24 577
A.M.A. Hariri United Kingdom 13 572 0.7× 207 0.4× 120 0.9× 24 1.0× 39 1.7× 16 690
Irfan M. Ovacik United States 10 597 0.7× 159 0.3× 74 0.5× 20 0.8× 41 1.8× 15 639
Wen-Hung Wu Taiwan 12 433 0.5× 204 0.4× 29 0.2× 51 2.1× 20 0.9× 20 451
Ling‐Huey Su Taiwan 11 378 0.5× 101 0.2× 25 0.2× 23 1.0× 19 0.8× 31 405
Yu. N. Sotskov Belarus 10 375 0.5× 111 0.2× 34 0.2× 27 1.1× 44 1.9× 20 430

Countries citing papers authored by Baruch Mor

Since Specialization
Citations

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

Fields of papers citing papers by Baruch Mor

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Baruch Mor

This figure shows the co-authorship network connecting the top 25 collaborators of Baruch Mor. A scholar is included among the top collaborators of Baruch Mor 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 Baruch Mor. Baruch Mor 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.
Mor, Baruch, et al.. (2025). Scheduling problems on parallel dedicated machines with non-renewable resource. Annals of Operations Research. 346(3). 2173–2193. 1 indexed citations
3.
Mor, Baruch & Xin-Na Geng. (2025). Improved algorithm for minimizing total late work on a proportionate flow shop and extensions to job rejection and generalized due dates. Computers & Operations Research. 181. 107046–107046.
4.
Geng, Xin-Na, Xinyu Sun, Jiayin Wang, & Baruch Mor. (2025). Scheduling on proportionate flowshop with total late work and job rejection. Operational Research. 25(3). 2 indexed citations
5.
Mor, Baruch, et al.. (2023). Lot scheduling involving completion time problems on identical parallel machines. Operational Research. 23(1). 2 indexed citations
6.
Mor, Baruch. (2023). Single machine scheduling problems involving job-dependent step-deterioration dates and job rejection. Operational Research. 23(1). 4 indexed citations
7.
Shabtay, Dvir & Baruch Mor. (2022). Exact algorithms and approximation schemes for proportionate flow shop scheduling with step-deteriorating processing times. Journal of Scheduling. 27(3). 239–256. 8 indexed citations
8.
Mor, Baruch, et al.. (2022). Scheduling data gathering with background communications and a processing stage. Computers & Industrial Engineering. 171. 108467–108467. 1 indexed citations
9.
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
10.
Mor, Baruch & Dana Shapira. (2021). Minsum scheduling with acceptable lead-times and optional job rejection. Optimization Letters. 16(3). 1073–1091. 6 indexed citations
11.
Mor, Baruch & Dana Shapira. (2019). Improved algorithms for scheduling on proportionate flowshop with job-rejection. Journal of the Operational Research Society. 70(11). 1997–2003. 22 indexed citations
12.
Mor, Baruch. (2017). Minmax common due-window assignment and scheduling on a single machine with two competing agents. Journal of the Operational Research Society. 69(4). 589–602. 10 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.
Mor, Baruch & Gur Mosheiov. (2016). Minimizing maximum cost on a single machine with two competing agents and job rejection. Journal of the Operational Research Society. 67(12). 1524–1531. 22 indexed citations
16.
Mor, Baruch, et al.. (2016). Brief Announcement. 357–359. 1 indexed citations
17.
Mor, Baruch & Gur Mosheiov. (2014). A note: Minimizing maximum earliness on a proportionate flowshop. Information Processing Letters. 115(2). 253–255. 9 indexed citations
18.
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
19.
Mor, Baruch & Gur Mosheiov. (2014). Scheduling a deteriorating maintenance activity and due-window assignment. Computers & Operations Research. 57. 33–40. 28 indexed citations
20.
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

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