Dvir Shabtay

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 51

Top Topics

Top Venues

Eur. J. Oper. Res.

Ann. Oper. Res.

Publications

Klaus Heeger, Danny Hermelin, Matthias Mnich, Dvir Shabtay
No Polynomial Kernels for Knapsack. ICALP (2024)
Danny Hermelin, Hendrik Molter, Dvir Shabtay
Minimizing the Weighted Number of Tardy Jobs via (max,+)-Convolutions. INFORMS J. Comput. 36 (3) (2024)
Klaus Heeger, Danny Hermelin, Michael L. Pinedo, Dvir Shabtay
Minimizing the Number of Tardy Jobs and Maximal Tardiness on a Single Machine is NP-hard. CoRR (2024)
Dvir Shabtay, Enrique Gerstl
Coordinating scheduling and rejection decisions in a two-machine flow shop scheduling problem. Eur. J. Oper. Res. 316 (3) (2024)
Klaus Heeger, Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Dvir Shabtay
Fair Repetitive Interval Scheduling. CoRR (2024)
Dvir Shabtay, Baruch Mor
Exact algorithms and approximation schemes for proportionate flow shop scheduling with step-deteriorating processing times. J. Sched. 27 (3) (2024)
Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Dvir Shabtay
On the parameterized complexity of interval scheduling with eligible machine sets. J. Comput. Syst. Sci. 144 (2024)
Dvir Shabtay, Miri Gilenson
A state-of-the-art survey on multi-scenario scheduling. Eur. J. Oper. Res. 310 (1) (2023)
Dvir Shabtay
A new perspective on single-machine scheduling problems with late work related criteria. Ann. Oper. Res. 322 (2) (2023)
Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay
Equitable scheduling on a single machine. J. Sched. 26 (2) (2023)
Klaus Heeger, Danny Hermelin, Dvir Shabtay
Single Machine Scheduling with Few Deadlines. IPEC (2023)
Klaus Heeger, Danny Hermelin, Matthias Mnich, Dvir Shabtay
No Polynomial Kernels for Knapsack. CoRR (2023)
Gur Mosheiov, Daniel Oron, Dvir Shabtay
On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates. J. Sched. 25 (5) (2022)
Baruch Mor, Dvir Shabtay
Single-machine scheduling with total late work and job rejection. Comput. Ind. Eng. 169 (2022)
Danny Hermelin, Hendrik Molter, Dvir Shabtay
Single Machine Weighted Number of Tardy Jobs Minimization With Small Weights. CoRR (2022)
Karl Bringmann, Nick Fischer, Danny Hermelin, Dvir Shabtay, Philip Wellnitz
Faster Minimization of Tardy Processing Time on a Single Machine. Algorithmica 84 (5) (2022)
Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay
Scheduling lower bounds via AND subset sum. J. Comput. Syst. Sci. 127 (2022)
Dvir Shabtay
Single-machine scheduling with machine unavailability periods and resource dependent processing times. Eur. J. Oper. Res. 296 (2) (2022)
Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Dvir Shabtay
Hardness of Interval Scheduling on Unrelated Machines. IPEC (2022)
Danny Hermelin, Dvir Shabtay, Chen Zelig, Michael L. Pinedo
A general scheme for solving a large set of scheduling problems with rejection in FPT time. J. Sched. 25 (2) (2022)
Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay
SETH-based Lower Bounds for Subset Sum and Bicriteria Path. ACM Trans. Algorithms 18 (1) (2022)
Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Dvir Shabtay
Hardness of Interval Scheduling on Unrelated Machines. CoRR (2022)
Dvir Shabtay, Gur Mosheiov, Daniel Oron
Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work. Eur. J. Oper. Res. 303 (1) (2022)
Baruch Mor, Gur Mosheiov, Dvir Shabtay
Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates. J. Sched. 24 (6) (2021)
Danny Hermelin, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay
Equitable Scheduling for the Total Completion Time Objective. CoRR (2021)
Miri Gilenson, Dvir Shabtay, Liron Yedidsion, Rohit Malshe
Scheduling in multi-scenario environment with an agreeable condition on job processing times. Ann. Oper. Res. 307 (1) (2021)
Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay
Equitable Scheduling on a Single Machine. AAAI (2021)
Miri Gilenson, Dvir Shabtay
Multi-scenario scheduling to maximise the weighted number of just-in-time jobs. J. Oper. Res. Soc. 72 (8) (2021)
Baruch Mor, Dvir Shabtay, Liron Yedidsion
Heuristic algorithms for solving a set of NP-hard single-machine scheduling problems with resource-dependent processing times. Comput. Ind. Eng. 153 (2021)
Danny Hermelin, Shlomo Karhi, Michael L. Pinedo, Dvir Shabtay
New algorithms for minimizing the weighted number of tardy jobs on a single machine. Ann. Oper. Res. 298 (1) (2021)
Gur Mosheiov, Daniel Oron, Dvir Shabtay
Minimizing total late work on a single machine with generalized due-dates. Eur. J. Oper. Res. 293 (3) (2021)
Karl Bringmann, Nick Fischer, Danny Hermelin, Dvir Shabtay, Philip Wellnitz
Faster Minimization of Tardy Processing Time on a Single Machine. ICALP (2020)
Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay
Equitable Scheduling on a Single Machine. CoRR (2020)
Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay
Scheduling Lower Bounds via AND Subset Sum. CoRR (2020)
Karl Bringmann, Nick Fischer, Danny Hermelin, Dvir Shabtay, Philip Wellnitz
Faster Minimization of Tardy Processing\newline Time on a Single Machine. CoRR (2020)
Danny Hermelin, George Manoussakis, Michael L. Pinedo, Dvir Shabtay, Liron Yedidsion
Parameterized Multi-Scenario Single-Machine Scheduling Problems. Algorithmica 82 (9) (2020)
Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay
Scheduling Lower Bounds via AND Subset Sum. ICALP (2020)
Danny Hermelin, Michael L. Pinedo, Dvir Shabtay, Nimrod Talmon
On the parameterized tractability of single machine scheduling with rejection. Eur. J. Oper. Res. 273 (1) (2019)
Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay
SETH-Based Lower Bounds for Subset Sum and Bicriteria Path. SODA (2019)
Danny Hermelin, Dvir Shabtay, Nimrod Talmon
On the parameterized tractability of the just-in-time flow-shop scheduling problem. J. Sched. 22 (6) (2019)
Nir Halman, Mikhail Y. Kovalyov, Alain Quilliot, Dvir Shabtay, Moshe Zofi
Bi-criteria path problem with minimum length and maximum survival probability. OR Spectr. 41 (2) (2019)
Shlomo Karhi, Dvir Shabtay
Single machine scheduling to minimise resource consumption cost with a bound on scheduling plus due date assignment penalties. Int. J. Prod. Res. 56 (9) (2018)
Danny Hermelin, Dvir Shabtay, Nimrod Talmon
On The Parameterized Tractability of the Just-In-Time Flow-Shop Scheduling Problem. CoRR (2017)
Daniel Oron, Dvir Shabtay, George Steiner
Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times. Eur. J. Oper. Res. 256 (2) (2017)
Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay
SETH-Based Lower Bounds for Subset Sum and Bicriteria Path. CoRR (2017)
Liron Yedidsion, Dvir Shabtay
The resource dependent assignment problem with a convex agent cost function. Eur. J. Oper. Res. 261 (2) (2017)
Danny Hermelin, Shlomo Karhi, Mike Pinedo, Dvir Shabtay
New Algorithms for Minimizing the Weighted Number of Tardy Jobs On a Single Machine. CoRR (2017)
Danny Hermelin, Judith-Madeleine Kubitza, Dvir Shabtay, Nimrod Talmon, Gerhard J. Woeginger
Scheduling Two Agents on a Single Machine: A Parameterized Analysis of NP-hard Problems. CoRR (2017)
Dvir Shabtay, Daniel Oron
Proportionate flow-shop scheduling with rejection. J. Oper. Res. Soc. 67 (5) (2016)
Omri Dover, Dvir Shabtay
Single machine scheduling with two competing agents, arbitrary release dates and unit processing times. Ann. Oper. Res. 238 (1-2) (2016)
Dvir Shabtay
Optimal restricted due date assignment in scheduling. Eur. J. Oper. Res. 252 (1) (2016)
Dvir Shabtay, Nufar Gaspar, Moshe Kaspi
Erratum to: A survey on offline scheduling with rejection. J. Sched. 18 (3) (2015)
Daniel Oron, Dvir Shabtay, George Steiner
Single machine scheduling with two competing agents and equal job processing times. Eur. J. Oper. Res. 244 (1) (2015)
Dvir Shabtay, Shlomo Karhi, Daniel Oron
Multipurpose machine scheduling with rejection and identical job processing times. J. Sched. 18 (1) (2015)
Dvir Shabtay, George Steiner, Liron Yedidsion
A pseudo-polynomial time algorithm for solving the resource dependent assignment problem. Discret. Appl. Math. 182 (2015)
Danny Hermelin, Judith-Madeleine Kubitza, Dvir Shabtay, Nimrod Talmon, Gerhard J. Woeginger
Scheduling Two Competing Agents When One Agent Has Significantly Fewer Jobs. IPEC (2015)
Dvir Shabtay
The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost. Eur. J. Oper. Res. 233 (1) (2014)
Gur Mosheiov, Dvir Shabtay
Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times. J. Sched. 16 (5) (2013)
Shlomo Karhi, Dvir Shabtay
On the optimality of the TLS algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines. J. Comb. Optim. 26 (1) (2013)
Dvir Shabtay, Nufar Gaspar, Moshe Kaspi
A survey on offline scheduling with rejection. J. Sched. 16 (1) (2013)
Baruch Mor, Gur Mosheiov, Dvir Shabtay
A note: Minmax due-date assignment problem with lead-time cost. Comput. Oper. Res. 40 (8) (2013)
Dvir Shabtay, Nufar Gasper
Two-machine flow-shop scheduling with rejection. Comput. Oper. Res. 39 (5) (2012)
Dvir Shabtay, Yaron Bensoussan
Maximizing the weighted number of just-in-time jobs in several two-machine scheduling systems. J. Sched. 15 (1) (2012)
Dvir Shabtay, Shlomo Karhi
Online scheduling of two job types on a set of multipurpose machines with unit processing times. Comput. Oper. Res. 39 (2) (2012)
Dvir Shabtay, Nufar Gaspar, Liron Yedidsion
A bicriteria approach to scheduling a single machine with job rejection and positional penalties. J. Comb. Optim. 23 (4) (2012)
Dvir Shabtay, Shlomo Karhi
An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times. Discret. Optim. 9 (4) (2012)
Dvir Shabtay
The just-in-time scheduling problem in a flow-shop scheduling system. Eur. J. Oper. Res. 216 (3) (2012)
Liron Yedidsion, Dvir Shabtay, Moshe Kaspi
Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling. Discret. Appl. Math. 159 (12) (2011)
Marvin Mandelbaum, Dvir Shabtay
Scheduling unit length jobs on parallel machines with lookahead information. J. Sched. 14 (4) (2011)
Eugene Levner, Avishai Ceder, Amir Elalouf, Yuval Hadas, Dvir Shabtay
Detection and improvement of deficiencies and failures in public-transportation networks using agent-enhanced distribution data mining. IEEM (2011)
Vladimir G. Deineko, Dvir Shabtay, George Steiner
On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices. J. Heuristics 17 (1) (2011)
Dvir Shabtay, George Steiner
A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates. J. Sched. 14 (5) (2011)
Dvir Shabtay, Yisrael Itskovich, Liron Yedidsion, Daniel Oron
Optimal due date assignment and resource allocation in a group technology scheduling environment. Comput. Oper. Res. 37 (12) (2010)
Yaron Leyvand, Dvir Shabtay, George Steiner
A unified approach for scheduling with convex resource consumption functions using positional penalties. Eur. J. Oper. Res. 206 (2) (2010)
Yaron Leyvand, Dvir Shabtay, George Steiner, Liron Yedidsion
Just-in-time scheduling with controllable processing times on parallel machines. J. Comb. Optim. 19 (3) (2010)
Dvir Shabtay, George Steiner, Liron Yedidsion
Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments. Discret. Appl. Math. 158 (10) (2010)
Dvir Shabtay, George Steiner
The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times. Ann. Oper. Res. 159 (1) (2008)
Dvir Shabtay
Due date assignments and scheduling a single machine with a general earliness/tardiness cost function. Comput. Oper. Res. 35 (5) (2008)
Dvir Shabtay, George Steiner
Optimal due date assignment in multi-machine scheduling environments. J. Sched. 11 (3) (2008)
Dvir Shabtay, George Steiner
A survey of scheduling with controllable processing times. Discret. Appl. Math. 155 (13) (2007)
Dvir Shabtay, George Steiner
Optimal Due Date Assignment and Resource Allocation to Minimize the Weighted Number of Tardy Jobs on a Single Machine. Manuf. Serv. Oper. Manag. 9 (3) (2007)
Liron Yedidsion, Dvir Shabtay, Moshe Kaspi
A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine. J. Sched. 10 (6) (2007)
Dvir Shabtay, Moshe Kaspi
Parallel machine scheduling with a convex resource consumption function. Eur. J. Oper. Res. 173 (1) (2006)
Moshe Kaspi, Dvir Shabtay
A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates. Comput. Oper. Res. 33 (10) (2006)
Dvir Shabtay, George Steiner
Two due date assignment problems in scheduling a single machine. Oper. Res. Lett. 34 (6) (2006)
Dvir Shabtay
Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine. Comput. Oper. Res. 31 (8) (2004)
Dvir Shabtay, Moshe Kaspi
Minimizing the total weighted flow time in a single machine with controllable processing times. Comput. Oper. Res. 31 (13) (2004)
Moshe Kaspi, Dvir Shabtay
Convex resource allocation for minimizing the makespan in a single machine with job release dates. Comput. Oper. Res. 31 (9) (2004)