Convex resource allocation for minimizing the makespan in a single machine with job release dates. - Moshe Kaspi; Dvir Shabtay (Comput. Oper. Res., 2004)

Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine. - Dvir Shabtay (Comput. Oper. Res., 2004)

Minimizing the total weighted flow time in a single machine with controllable processing times. - Dvir Shabtay; Moshe Kaspi (Comput. Oper. Res., 2004)

A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates. - Moshe Kaspi; Dvir Shabtay (Comput. Oper. Res., 2006)

Parallel machine scheduling with a convex resource consumption function. - Dvir Shabtay; Moshe Kaspi (Eur. J. Oper. Res., 2006)

Two due date assignment problems in scheduling a single machine. - Dvir Shabtay; George Steiner (Oper. Res. Lett., 2006)

A survey of scheduling with controllable processing times. - Dvir Shabtay; George Steiner (Discret. Appl. Math., 2007)

Optimal Due Date Assignment and Resource Allocation to Minimize the Weighted Number of Tardy Jobs on a Single Machine. - Dvir Shabtay; George Steiner (Manuf. Serv. Oper. Manag., 2007)

Single machine batch scheduling to minimize total completion time and resource consumption costs. - Dvir Shabtay; George Steiner (J. Sched., 2007)

A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine. - Liron Yedidsion; Dvir Shabtay; Moshe Kaspi (J. Sched., 2007)

The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times. - Dvir Shabtay; George Steiner (Ann. Oper. Res., 2008)

Due date assignments and scheduling a single machine with a general earliness/tardiness cost function. - Dvir Shabtay (Comput. Oper. Res., 2008)

Optimal due date assignment in multi-machine scheduling environments. - Dvir Shabtay; George Steiner (J. Sched., 2008)

Optimal due date assignment and resource allocation in a group technology scheduling environment. - Dvir Shabtay; Yisrael Itskovich; Liron Yedidsion; Daniel Oron (Comput. Oper. Res., 2010)

Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments. - Dvir Shabtay; George Steiner; Liron Yedidsion (Discret. Appl. Math., 2010)

A unified approach for scheduling with convex resource consumption functions using positional penalties. - Yaron Leyvand; Dvir Shabtay; George Steiner (Eur. J. Oper. Res., 2010)

Just-in-time scheduling with controllable processing times on parallel machines. - Yaron Leyvand; Dvir Shabtay; George Steiner; Liron Yedidsion (J. Comb. Optim., 2010)

Detection and improvement of deficiencies and failures in public-transportation networks using agent-enhanced distribution data mining. - Eugene Levner; Avishai Ceder; Amir Elalouf; Yuval Hadas; Dvir Shabtay (IEEM, 2011)

Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling. - Liron Yedidsion; Dvir Shabtay; Moshe Kaspi (Discret. Appl. Math., 2011)

On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices. - Vladimir G. Deineko; Dvir Shabtay; George Steiner (J. Heuristics, 2011)

Scheduling unit length jobs on parallel machines with lookahead information. - Marvin Mandelbaum; Dvir Shabtay (J. Sched., 2011)

A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates. - Dvir Shabtay; George Steiner (J. Sched., 2011)

Two-machine flow-shop scheduling with rejection. - Dvir Shabtay; Nufar Gasper (Comput. Oper. Res., 2012)

Online scheduling of two job types on a set of multipurpose machines with unit processing times. - Dvir Shabtay; Shlomo Karhi (Comput. Oper. Res., 2012)

An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times. - Dvir Shabtay; Shlomo Karhi (Discret. Optim., 2012)

The just-in-time scheduling problem in a flow-shop scheduling system. - Dvir Shabtay (Eur. J. Oper. Res., 2012)

A bicriteria approach to scheduling a single machine with job rejection and positional penalties. - Dvir Shabtay; Nufar Gaspar; Liron Yedidsion (J. Comb. Optim., 2012)

Maximizing the weighted number of just-in-time jobs in several two-machine scheduling systems. - Dvir Shabtay; Yaron Bensoussan (J. Sched., 2012)

A note: Minmax due-date assignment problem with lead-time cost. - Baruch Mor; Gur Mosheiov; Dvir Shabtay (Comput. Oper. Res., 2013)

On the optimality of the TLS algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines. - Shlomo Karhi; Dvir Shabtay (J. Comb. Optim., 2013)

Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times. - Gur Mosheiov; Dvir Shabtay (J. Sched., 2013)

A survey on offline scheduling with rejection. - Dvir Shabtay; Nufar Gaspar; Moshe Kaspi (J. Sched., 2013)

The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost. - Dvir Shabtay (Eur. J. Oper. Res., 2014)

Scheduling Two Competing Agents When One Agent Has Significantly Fewer Jobs. - Danny Hermelin; Judith-Madeleine Kubitza; Dvir Shabtay; Nimrod Talmon; Gerhard J. Woeginger (IPEC, 2015)

A pseudo-polynomial time algorithm for solving the resource dependent assignment problem. - Dvir Shabtay; George Steiner; Liron Yedidsion (Discret. Appl. Math., 2015)

Single machine scheduling with two competing agents and equal job processing times. - Daniel Oron; Dvir Shabtay; George Steiner (Eur. J. Oper. Res., 2015)

Erratum to: A survey on offline scheduling with rejection. - Dvir Shabtay; Nufar Gaspar; Moshe Kaspi (J. Sched., 2015)

Multipurpose machine scheduling with rejection and identical job processing times. - Dvir Shabtay; Shlomo Karhi; Daniel Oron (J. Sched., 2015)

Single machine scheduling with two competing agents, arbitrary release dates and unit processing times. - Omri Dover; Dvir Shabtay (Ann. Oper. Res., 2016)

Optimal restricted due date assignment in scheduling. - Dvir Shabtay (Eur. J. Oper. Res., 2016)

Proportionate flow-shop scheduling with rejection. - Dvir Shabtay; Daniel Oron (J. Oper. Res. Soc., 2016)

Scheduling Two Agents on a Single Machine: A Parameterized Analysis of NP-hard Problems. - Danny Hermelin; Judith-Madeleine Kubitza; Dvir Shabtay; Nimrod Talmon; Gerhard J. Woeginger (CoRR, 2017)

New Algorithms for Minimizing the Weighted Number of Tardy Jobs On a Single Machine. - Danny Hermelin; Shlomo Karhi; Mike Pinedo; Dvir Shabtay (CoRR, 2017)

Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times. - Daniel Oron; Dvir Shabtay; George Steiner (Eur. J. Oper. Res., 2017)

The resource dependent assignment problem with a convex agent cost function. - Liron Yedidsion; Dvir Shabtay (Eur. J. Oper. Res., 2017)

Single machine scheduling to minimise resource consumption cost with a bound on scheduling plus due date assignment penalties. - Shlomo Karhi; Dvir Shabtay (Int. J. Prod. Res., 2018)

On the parameterized tractability of single machine scheduling with rejection. - Danny Hermelin; Michael L. Pinedo; Dvir Shabtay; Nimrod Talmon (Eur. J. Oper. Res., 2019)

Bi-criteria path problem with minimum length and maximum survival probability. - Nir Halman; Mikhail Y. Kovalyov; Alain Quilliot; Dvir Shabtay; Moshe Zofi (OR Spectr., 2019)

On the parameterized tractability of the just-in-time flow-shop scheduling problem. - Danny Hermelin; Dvir Shabtay; Nimrod Talmon (J. Sched., 2019)

Parameterized Multi-Scenario Single-Machine Scheduling Problems. - Danny Hermelin; George Manoussakis; Michael L. Pinedo; Dvir Shabtay; Liron Yedidsion (Algorithmica, 2020)

Scheduling in multi-scenario environment with an agreeable condition on job processing times. - Miri Gilenson; Dvir Shabtay; Liron Yedidsion; Rohit Malshe (Ann. Oper. Res., 2021)

New algorithms for minimizing the weighted number of tardy jobs on a single machine. - Danny Hermelin; Shlomo Karhi; Michael L. Pinedo; Dvir Shabtay (Ann. Oper. Res., 2021)

Heuristic algorithms for solving a set of NP-hard single-machine scheduling problems with resource-dependent processing times. - Baruch Mor; Dvir Shabtay; Liron Yedidsion (Comput. Ind. Eng., 2021)

Equitable Scheduling for the Total Completion Time Objective. - Danny Hermelin; Hendrik Molter; Rolf Niedermeier; Dvir Shabtay (CoRR, 2021)

Minimizing total late work on a single machine with generalized due-dates. - Gur Mosheiov; Daniel Oron; Dvir Shabtay (Eur. J. Oper. Res., 2021)

Multi-scenario scheduling to maximise the weighted number of just-in-time jobs. - Miri Gilenson; Dvir Shabtay (J. Oper. Res. Soc., 2021)

Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates. - Baruch Mor; Gur Mosheiov; Dvir Shabtay (J. Sched., 2021)

Hardness of Interval Scheduling on Unrelated Machines. - Danny Hermelin; Yuval Itzhaki; Hendrik Molter; Dvir Shabtay (IPEC, 2022)

Faster Minimization of Tardy Processing Time on a Single Machine. - Karl Bringmann; Nick Fischer; Danny Hermelin; Dvir Shabtay; Philip Wellnitz (Algorithmica, 2022)

Single-machine scheduling with total late work and job rejection. - Baruch Mor; Dvir Shabtay (Comput. Ind. Eng., 2022)

Single Machine Weighted Number of Tardy Jobs Minimization With Small Weights. - Danny Hermelin; Hendrik Molter; Dvir Shabtay (CoRR, 2022)

Single-machine scheduling with machine unavailability periods and resource dependent processing times. - Dvir Shabtay (Eur. J. Oper. Res., 2022)

Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work. - Dvir Shabtay; Gur Mosheiov; Daniel Oron (Eur. J. Oper. Res., 2022)

Scheduling lower bounds via AND subset sum. - Amir Abboud; Karl Bringmann; Danny Hermelin; Dvir Shabtay (J. Comput. Syst. Sci., 2022)

A general scheme for solving a large set of scheduling problems with rejection in FPT time. - Danny Hermelin; Dvir Shabtay; Chen Zelig; Michael L. Pinedo (J. Sched., 2022)

On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates. - Gur Mosheiov; Daniel Oron; Dvir Shabtay (J. Sched., 2022)

SETH-based Lower Bounds for Subset Sum and Bicriteria Path. - Amir Abboud; Karl Bringmann; Danny Hermelin; Dvir Shabtay (ACM Trans. Algorithms, 2022)

Single Machine Scheduling with Few Deadlines. - Klaus Heeger; Danny Hermelin; Dvir Shabtay (IPEC, 2023)

A state-of-the-art survey on multi-scenario scheduling. - Dvir Shabtay; Miri Gilenson (Eur. J. Oper. Res., 2023)

Equitable scheduling on a single machine. - Klaus Heeger; Danny Hermelin; George B. Mertzios; Hendrik Molter; Rolf Niedermeier; Dvir Shabtay (J. Sched., 2023)

A new perspective on single-machine scheduling problems with late work related criteria. - Dvir Shabtay (Ann. Oper. Res., 2023)

No Polynomial Kernels for Knapsack. - Klaus Heeger; Danny Hermelin; Matthias Mnich; Dvir Shabtay (ICALP, 2024)

Minimizing the Number of Tardy Jobs and Maximal Tardiness on a Single Machine is NP-hard. - Klaus Heeger; Danny Hermelin; Michael L. Pinedo; Dvir Shabtay (CoRR, 2024)

Coordinating scheduling and rejection decisions in a two-machine flow shop scheduling problem. - Dvir Shabtay; Enrique Gerstl (Eur. J. Oper. Res., 2024)

Minimizing the Weighted Number of Tardy Jobs via (max,+)-Convolutions. - Danny Hermelin; Hendrik Molter; Dvir Shabtay (INFORMS J. Comput., 2024)

On the parameterized complexity of interval scheduling with eligible machine sets. - Danny Hermelin; Yuval Itzhaki; Hendrik Molter; Dvir Shabtay (J. Comput. Syst. Sci., 2024)

Exact algorithms and approximation schemes for proportionate flow shop scheduling with step-deteriorating processing times. - Dvir Shabtay; Baruch Mor (J. Sched., 2024)

Fifty years of research in scheduling - Theory and applications. - Alessandro Agnetis; Jean-Charles Billaut; Michael L. Pinedo; Dvir Shabtay (Eur. J. Oper. Res., 2025)

Fairness in repetitive scheduling. - Danny Hermelin; Hendrik Molter; Rolf Niedermeier; Michael L. Pinedo; Dvir Shabtay (Eur. J. Oper. Res., 2025)

Faster Minimization of Total Weighted Completion Time on Parallel Machines. - Danny Hermelin; Tomohiro Koana; Dvir Shabtay (CoRR, 2025)

Scheduling problems on parallel machines with machine-dependent generalized due-dates. - Baruch Mor; Gur Mosheiov; Dvir Shabtay (Ann. Oper. Res., 2025)

Fair Repetitive Interval Scheduling. - Klaus Heeger; Danny Hermelin; Yuval Itzhaki; Hendrik Molter; Dvir Shabtay (Algorithmica, 2025)