Daniel Oron

911 total citations
43 papers, 718 citations indexed

About

Daniel Oron is a scholar working on Industrial and Manufacturing Engineering, Computer Networks and Communications and Management Information Systems. According to data from OpenAlex, Daniel Oron has authored 43 papers receiving a total of 718 indexed citations (citations by other indexed papers that have themselves been cited), including 43 papers in Industrial and Manufacturing Engineering, 30 papers in Computer Networks and Communications and 5 papers in Management Information Systems. Recurrent topics in Daniel Oron's work include Scheduling and Optimization Algorithms (42 papers), Optimization and Search Problems (30 papers) and Advanced Manufacturing and Logistics Optimization (25 papers). Daniel Oron is often cited by papers focused on Scheduling and Optimization Algorithms (42 papers), Optimization and Search Problems (30 papers) and Advanced Manufacturing and Logistics Optimization (25 papers). Daniel Oron collaborates with scholars based in Australia, Israel and Canada. Daniel Oron's co-authors include Gur Mosheiov, Dvir Shabtay, Gur Mosheiov, Ya’acov Ritov, George Steiner, M. Duran Toksarı, Ertan Güner, Liron Yedidsion, Baruch Mor and Rui Yu and has published in prestigious journals such as SHILAP Revista de lepidopterología, European Journal of Operational Research and International Journal of Production Economics.

In The Last Decade

Daniel Oron

41 papers receiving 693 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Daniel Oron Australia 18 697 384 78 27 22 43 718
Baruch Mor Israel 17 825 1.2× 481 1.3× 140 1.8× 14 0.5× 23 1.0× 63 847
Lingfa Lu China 14 604 0.9× 334 0.9× 73 0.9× 17 0.6× 29 1.3× 41 624
Guoqing Wang China 12 912 1.3× 375 1.0× 73 0.9× 35 1.3× 34 1.5× 19 939
Xue Huang China 17 677 1.0× 342 0.9× 40 0.5× 11 0.4× 7 0.3× 34 687
Stanisław Gawiejnowicz Poland 18 1.2k 1.7× 657 1.7× 88 1.1× 67 2.5× 24 1.1× 35 1.2k
Irfan M. Ovacik United States 10 597 0.9× 159 0.4× 74 0.9× 36 1.3× 41 1.9× 15 639
Surya Danusaputro Liman United States 9 382 0.5× 179 0.5× 59 0.8× 16 0.6× 14 0.6× 18 403
Ameur Soukhal France 12 556 0.8× 275 0.7× 53 0.7× 50 1.9× 21 1.0× 24 577
Ling‐Huey Su Taiwan 11 378 0.5× 101 0.3× 25 0.3× 32 1.2× 19 0.9× 31 405
Wen-Hung Wu Taiwan 12 433 0.6× 204 0.5× 29 0.4× 18 0.7× 20 0.9× 20 451

Countries citing papers authored by Daniel Oron

Since Specialization
Citations

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

Fields of papers citing papers by Daniel Oron

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Daniel Oron

This figure shows the co-authorship network connecting the top 25 collaborators of Daniel Oron. A scholar is included among the top collaborators of Daniel Oron 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 Daniel Oron. Daniel Oron 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.
3.
Oron, Daniel, et al.. (2024). Minimizing the number of late jobs and total late work with step-learning. European Journal of Operational Research. 321(3). 734–749. 1 indexed citations
4.
Oron, Daniel, et al.. (2023). Scheduling coupled tasks on parallel identical machines. Optimization Letters. 18(4). 991–1003.
5.
Oron, Daniel, et al.. (2023). Two-agent single-machine scheduling with a rate-modifying activity. European Journal of Operational Research. 312(3). 866–876. 7 indexed citations
6.
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
7.
Mosheiov, Gur, Daniel Oron, & Dvir Shabtay. (2022). On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates. Journal of Scheduling. 25(5). 577–587. 6 indexed citations
8.
Mosheiov, Gur, Daniel Oron, & Dvir Shabtay. (2021). Minimizing total late work on a single machine with generalized due-dates. European Journal of Operational Research. 293(3). 837–846. 34 indexed citations
9.
Mosheiov, Gur & Daniel Oron. (2021). A note on scheduling a rate modifying activity to minimize total late work. Computers & Industrial Engineering. 154. 107138–107138. 15 indexed citations
10.
Oron, Daniel, Dvir Shabtay, & George Steiner. (2015). Single machine scheduling with two competing agents and equal job processing times. European Journal of Operational Research. 244(1). 86–99. 48 indexed citations
11.
Oron, Daniel. (2013). Scheduling controllable processing time jobs in a deteriorating environment. Journal of the Operational Research Society. 65(1). 49–56. 37 indexed citations
12.
Oron, Daniel, et al.. (2012). Multi-location production and delivery with job selection. Computers & Operations Research. 40(5). 1461–1466. 2 indexed citations
13.
Mosheiov, Gur & Daniel Oron. (2011). Batch scheduling on a two-machine jobshop with machine-dependent setup times. Naval Research Logistics (NRL). n/a–n/a. 4 indexed citations
14.
Mosheiov, Gur & Daniel Oron. (2010). Job-Dependent Due-Window Assignment Based On A Common Flow Allowance. Foundations of Computing and Decision Sciences. 185–195. 34 indexed citations
15.
Toksarı, M. Duran, Daniel Oron, & Ertan Güner. (2009). Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning. Mathematical and Computer Modelling. 50(3-4). 401–406. 30 indexed citations
16.
Oron, Daniel, et al.. (2009). The bipartite margin shop and maximum red matchings free of blue–red alternating cycles. Discrete Optimization. 6(3). 299–309. 2 indexed citations
17.
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
18.
Oron, Daniel. (2006). Single machine scheduling with simple linear deterioration to minimize total absolute deviation of completion times. Computers & Operations Research. 35(6). 2071–2078. 39 indexed citations
19.
Mosheiov, Gur, Daniel Oron, & Ya’acov Ritov. (2004). Flow‐shop batch scheduling with identical processing‐time jobs. Naval Research Logistics (NRL). 51(6). 783–799. 21 indexed citations
20.
Mosheiov, Gur & Daniel Oron. (2003). A note on the SPT heuristic for solving scheduling problems with generalized due dates. Computers & Operations Research. 31(5). 645–655. 27 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