Dvir Shabtay

3.0k total citations · 1 hit paper
88 papers, 2.1k citations indexed

About

Dvir Shabtay is a scholar working on Industrial and Manufacturing Engineering, Computer Networks and Communications and Computational Theory and Mathematics. According to data from OpenAlex, Dvir Shabtay has authored 88 papers receiving a total of 2.1k indexed citations (citations by other indexed papers that have themselves been cited), including 85 papers in Industrial and Manufacturing Engineering, 69 papers in Computer Networks and Communications and 7 papers in Computational Theory and Mathematics. Recurrent topics in Dvir Shabtay's work include Scheduling and Optimization Algorithms (82 papers), Optimization and Search Problems (69 papers) and Advanced Manufacturing and Logistics Optimization (35 papers). Dvir Shabtay is often cited by papers focused on Scheduling and Optimization Algorithms (82 papers), Optimization and Search Problems (69 papers) and Advanced Manufacturing and Logistics Optimization (35 papers). Dvir Shabtay collaborates with scholars based in Israel, Canada and United States. Dvir Shabtay's co-authors include George Steiner, Moshe Kaspi, Daniel Oron, Liron Yedidsion, Gur Mosheiov, Baruch Mor, Danny Hermelin, Marvin Mandelbaum, Nimrod Talmon and Michael Pinedo 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

Dvir Shabtay

84 papers receiving 2.0k citations

Hit Papers

A survey of scheduling with controllable processing times 2007 2026 2013 2019 2007 100 200 300
What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

  1. A survey of scheduling with controllable processing times
    2007 322 citations Dvir Shabtay, George Steiner Discrete Applied Mathematics profile →

Peers

Dvir Shabtay
Vitaly A. Strusevich United Kingdom
Wiesław Kubiak Canada
Marc E. Posner United States
Louis A. Martin-Vega United States
Wen‐Chiung Lee Taiwan
S. S. Panwalkar United States
J.A. Hoogeveen Netherlands
Gur Mosheiov Israel
Gerd Finke France
Moshe Kaspi Israel
Vitaly A. Strusevich United Kingdom
Dvir Shabtay
Citations per year, relative to Dvir Shabtay Dvir Shabtay (= 1×) peers Vitaly A. Strusevich

Countries citing papers authored by Dvir Shabtay

Since Specialization
Citations

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

Fields of papers citing papers by Dvir Shabtay

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Dvir Shabtay

This figure shows the co-authorship network connecting the top 25 collaborators of Dvir Shabtay. A scholar is included among the top collaborators of Dvir Shabtay 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 Dvir Shabtay. Dvir Shabtay 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.
Hermelin, Danny, Hendrik Molter, Rolf Niedermeier, Michael Pinedo, & Dvir Shabtay. (2025). Fairness in repetitive scheduling. European Journal of Operational Research. 323(3). 724–738. 2 indexed citations
3.
Agnetis, Alessandro, et al.. (2025). Fifty years of research in scheduling — Theory and applications. European Journal of Operational Research. 327(2). 367–393. 2 indexed citations
4.
Shabtay, Dvir & Enrique Gerstl. (2024). Coordinating scheduling and rejection decisions in a two-machine flow shop scheduling problem. European Journal of Operational Research. 316(3). 887–898. 3 indexed citations
5.
Hermelin, Danny, Hendrik Molter, & Dvir Shabtay. (2023). Minimizing the Weighted Number of Tardy Jobs via (max,+)-Convolutions. INFORMS journal on computing. 36(3). 836–848. 1 indexed citations
6.
Shabtay, Dvir. (2023). Maximizing the weighted number of just‐in‐time jobs in a distributed flow‐shop scheduling system. Naval Research Logistics (NRL). 70(3). 274–283. 2 indexed citations
7.
Shabtay, Dvir. (2022). A new perspective on single-machine scheduling problems with late work related criteria. Annals of Operations Research. 322(2). 947–966. 5 indexed citations
8.
Hermelin, Danny, et al.. (2022). A general scheme for solving a large set of scheduling problems with rejection in FPT time. Journal of Scheduling. 25(2). 229–255. 4 indexed citations
9.
Hermelin, Danny, et al.. (2022). Equitable scheduling on a single machine. Journal of Scheduling. 26(2). 209–225. 5 indexed citations
10.
Shabtay, Dvir, et al.. (2022). A state-of-the-art survey on multi-scenario scheduling. European Journal of Operational Research. 310(1). 3–23. 9 indexed citations
11.
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
12.
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
13.
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
14.
Shabtay, Dvir, et al.. (2021). Scheduling in multi-scenario environment with an agreeable condition on job processing times. Annals of Operations Research. 307(1-2). 153–173. 2 indexed citations
15.
Shabtay, Dvir, et al.. (2018). The multi-scenario scheduling problem to maximize the weighted number of just-in-time jobs. 87–91. 1 indexed citations
16.
Yedidsion, Liron & Dvir Shabtay. (2017). The resource dependent assignment problem with a convex agent cost function. European Journal of Operational Research. 261(2). 486–502. 8 indexed citations
17.
Shabtay, Dvir, George Steiner, & Liron Yedidsion. (2013). A pseudo-polynomial time algorithm for solving the resource dependent assignment problem. Discrete Applied Mathematics. 182. 115–121. 3 indexed citations
18.
Yedidsion, Liron, Dvir Shabtay, & Moshe Kaspi. (2011). Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling. Discrete Applied Mathematics. 159(12). 1264–1278. 10 indexed citations
19.
Shabtay, Dvir, Moshe Kaspi, & George Steiner. (2007). The no-wait two-machine flow shop scheduling problem with convex resource-dependent processing times. IIE Transactions. 39(5). 539–557. 27 indexed citations
20.
Shabtay, Dvir & George Steiner. (2007). A survey of scheduling with controllable processing times. Discrete Applied Mathematics. 155(13). 1643–1666. 322 indexed citations breakdown →

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

Breakdown of academic impact, for papers by Vitaly A. Strusevich Breakdown of academic impact, for papers by Wiesław Kubiak Breakdown of academic impact, for papers by Marc E. Posner Breakdown of academic impact, for papers by Louis A. Martin-Vega Breakdown of academic impact, for papers by Wen‐Chiung Lee Breakdown of academic impact, for papers by S. S. Panwalkar Breakdown of academic impact, for papers by J.A. Hoogeveen Breakdown of academic impact, for papers by Gur Mosheiov Breakdown of academic impact, for papers by Gerd Finke Breakdown of academic impact, for papers by Moshe Kaspi
Rankless by CCL
2026